Revision as of 15:36, 31 March 2004 edit Andris (talk \| contribs) 4,835 edits merged the information from a duplicate page ← Previous edit		Revision as of 20:27, 31 March 2004 edit undo Andris (talk \| contribs) 4,835 edits +comments to program Next edit →
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 false;~~ return true; //Lengths of shortest paths are in Distance array

Bellman–Ford algorithm: Difference between revisions