Content deleted Content added
Line 15:
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)
From what I understand, there may be many more than a single shortest path (think of two equal routes), and Bellman-Ford is guaranteed to find one of them. Thus an infinite number of equal shortest paths is not a problem. The issue with negative weight cycles is that you can always find a better path by adding one more cycle to the path and as such there is no shortest path. [[User:Kyeprime|kyeprime]] ([[User talk:Kyeprime|talk]]) 19:17, 21 April 2010 (UTC)
== Counting to infinity ==
| |||