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

Shortest Path: Dijkstra (8)
A
2
6
B (2, A)
2
1
G (5, E)
7
2
E (4, B)
4
F (6, E)
C (9, B)
3 3
2 2
H (8, F)
D (10, H)
Univ.-Prof. Dr.-Ing. Jochen H. Schiller ▪ cst.mi.fu-berlin.de ▪ Telematics ▪ Chapter 6: Network Layer
The distance to D
using C is larger than
the tentative label of
D. No more paths
exist, no states are
changed - the
algorithm terminates.
6.152