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

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