Dijkstra’s Algorithm (cont’d)

E(4, B)

Dijkstra’s Algorithm (cont’d)

• We examine each of the nodes adjacent F, relabeling each one with the distance to F.

2

A

B(2, A)

C(9, B)

F(6, E)

D(¥,-)

G(5, E)

H(8, F)

3

Previous slide

Next slide

Back to the first slide

View Graphic Version