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

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