Revision as of 09:08, 26 January 2005 edit Fvw (talk \| contribs) 19,601 edits m →[[Assembly programming language\|Assembly (NASM)]]: x86 ← Previous edit		Revision as of 19:57, 8 March 2005 edit undo Fredrik (talk \| contribs) 23,349 edits m →Proof of the Algorithm Next edit →
Line 20: return true; //Lengths of shortest paths are in Distance array == Proof of ~~the Algorithm~~correctness == The correctness of the algorithm can be shown by [[mathematical induction\|induction]]. The precise statement shown by induction is:

Bellman–Ford algorithm: Difference between revisions