Dijkstra’s Algorithm (cont’d)

Dijkstra’s Algorithm (cont’d)

We make G with the smallest label permanent.
G becomes the new working node.

A

B(2, A)

C(9, B)

E(4, B)

F(6, E)

D(Ą,-)

G(5, E)

H(Ą,-)

Previous slide Next slide Back to the first slide View Graphic Version