Project Links Logo Artwork
Graph Theory: Networking
Home > Graph Theory: Networking > Shortest-Path Algorithms > Bellman-Ford Algorithm
Crib Sheet
Library
Help
Map
Problem List
Module Home
Links Home


conceptsdiscoverapplycollaboratepractice
 
 
go backgo forward
go backgo forward

Bellman-Ford Algorithm

Problem 6:

Why does the Bellman-Ford algorithm give a right answer even for negative weights, provided no negative cycles exist?

 
 
go backgo forward
go backgo forward