Revision as of 18:40, 7 November 2005 edit Hdante (talk \| contribs) Extended confirmed users 1,076 edits Zero weight cycles ← Previous edit		Revision as of 15:29, 17 April 2006 edit undo Orbst (talk \| contribs) Extended confirmed users 534 edits 'counting to infinity' Next edit →
Line 10: I seems to me that if a graph has some cycle that weighs zero between start and end, then there could be infinite shortest paths. If this is correct, then the correctnes proof should be rewritten a little so that it states all the cases. --[[User:Hdante\|Hdante]] 18:40, 7 November 2005 (UTC) == Counting to infinity == I didn't know what "counting to infinity" meant in the list of limitations of the distributed algorithm, so I searched around a bit and added a few words expressing what I found. But if anyone has a better explanation, please do add. -- [[User:Orbst\|Orbst]] 15:29, 17 April 2006 (UTC)

Talk:Bellman–Ford algorithm: Difference between revisions