...
/The Control Plane: Route Calculation - Dijkstra's
The Control Plane: Route Calculation - Dijkstra's
In this lesson, we'll study Dijkstra's shortest path algorithm!
We'll cover the following...
Phase II: Route Calculation
Each router then computes the spanning tree rooted at itself and calculates the entries in the routing table by using Dijkstra’s shortest path algorithm. Dijkstra’s is a common algorithm that is usually taught in Algorithms or Data Structures classes. Let’s get a quick refresher of it.
Dijkstra’s Algorithm
The goal is to find the shortest path from an initial node to all other nodes in the graph.
We first need to set up some data structures for us to use throughout the ...