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

Shortest Path: Dijkstra (1)
● Algorithm of Dijkstra (1959) for static Routing
1. Mark source node (the work node) as permanent, i.e., distance and line do
not change any more
2. Consider neighbor nodes of the node currently marked as permanent, i.e.,
the work node, and compute the distance to them based on own knowledge
and link costs
3. Choose the node with the smallest distance to the source from the nodes not
marked yet and mark it as permanent, it becomes the new work node.
Goto 2.
Univ.-Prof. Dr.-Ing. Jochen H. Schiller ▪ cst.mi.fu-berlin.de ▪ Telematics ▪ Chapter 6: Network Layer
6.145