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

Shortest Path: Dijkstra (3)
A
2
6
B (2, A)
2
1
G (6, A)
E (�, -)
7
2
4
3
F (�, -)
C (�, -)
3
2 2
H (�, -)
D (�, -)
Univ.-Prof. Dr.-Ing. Jochen H. Schiller ▪ cst.mi.fu-berlin.de ▪ Telematics ▪ Chapter 6: Network Layer
In order to be able to
trace back the path later
on, the predecessor
node is stored.
3. Step: B becomes
permanent, because the
distance to A is 2 (< 6).
4. Step: Tentative
labeling of the neighbor
nodes of B.
6.147