Bellman–Ford algorithm: Difference between revisions

Revision as of 19:33, 2 June 2004

Revision as of 13:03, 27 July 2004

Line 16:

for each edge (u,r) in G do

if Distance(r) > Distance(u) + w(u,r);

return false; //This means that the graph contains a cycle of negative weight
//and the shortest paths are not well defined

return true; //Lengths of shortest paths are in Distance array