Dijkstra’s “Other” Algorithm

Dijkstra’s “Other” Algorithm

Initialize-Single-Source(G,s)

S ¬ f

Q ¬ V[G]

While Q ¹ f do

u ¬ EXTRACT-MIN(Q)

S ¬ S union {u}

for each vertex v in Adj[u] do

RELAX(u,v,w);

end for

end while

Previous slide

Next slide

Back to the first slide

View Graphic Version