Dijkstra’s AlgorithmAssumption: c(u,v) = infinity if (u,v) not in E.

DijkstraShortestPaths (directed graph G, vertex s):

Set U (initialized to be empty)

for each vertex v in G except s do

Dist(v) := infinity

U.insert(v);

Dist(s) := 0; U.insert(s);

repeat |V| times

v := any member of U with minimum Distance

U.Delete(v);

for each neighbor w of v do

if U.contains(w) then

Dist(w) := min(Dist(w), Dist(v) + c(v,w));

Previous slide

Next slide

Back to first slide

View graphic version