Talk:Bellman–Ford algorithm: Difference between revisions

Revision as of 14:39, 14 September 2006

Revision as of 14:41, 14 September 2006

Line 9:

== Zero weight cycles ==

'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)

sdz

a'f]

;]L;

]'

'

'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)

sdfdsfs

sdfsd

f

sd

f

sd

fsd

f

sd

== Counting to infinity ==