Bellman–Ford algorithm: Difference between revisions

Revision as of 01:51, 8 April 2005

Revision as of 03:15, 19 April 2005

Line 10:

for each vertex v in G other than s,

set Distance(v) = infinity, Predecessor(v) = nil;

for i <-= 1 to |V(G)| - 1 do //|V(G)| Number of vertices in the graph

for each edge (u,v) in G do

if Distance(v) > Distance(u) + w(u,v) then