Revision as of 22:37, 4 October 2006 edit Helix84 (talk \| contribs) 1,720 edits No edit summary ← Previous edit		Revision as of 08:13, 16 December 2006 edit undo Tomo (talk \| contribs) Extended confirmed users 781 edits →Computational complexity Next edit →
Line 26: == Computational complexity == Could you add info about computational complexity of the algorithm? ~~[[User:helix84\|helix84]] 22:37, 4 October 2006 (UTC) In the worst case this algorithm uses O(V<sup>3</sup>) time in order to find single-source shortest paths. This is not very efficient. By a slight modification it can find all-pairs shortest paths in the same time. [[User:Tomo\|Tomo]] 08:13, 16 December 2006 (UTC)

Talk:Bellman–Ford algorithm: Difference between revisions