Telematics Chapter 6: Network Layer - Freie Universität Berlin

Shortest Path: Dijkstra (6)
A
2
6
B (2, A)
2
1
G (5, E)
7
E (4, B)
2
4
F (6, E)
2
C (9, B)
2
H (9, G)
D (�, -)
Univ.-Prof. Dr.-Ing. Jochen H. Schiller ▪ cst.mi.fu-berlin.de ▪ Telematics ▪ Chapter 6: Network Layer
3
3
8. Step: Tentative label
of G is overwritten.
9. Step: F becomes
permanent, since the
distance to A is 6 (< 9).
10. Step: Tentative
labeling of the neighbor
nodes of F.
6.150