Dijkstra’s Algorithm (cont’d)

Dijkstra’s Algorithm (cont’d)

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

A

B(2, A)

C(9, B)

E(4, B)

F(6, E)

D(¥,-)

G(5, E)

H(8, F)

Previous slide

Next slide

Back to the first slide

View Graphic Version