Shortest Path First algorithm
Also called Dijkstra’s algorithm
The goal is to find the topology in the form of a shortest path tree (SPT)
From the SPT we build routing tables
also called Routing Information Base
Previous slide
Next slide
Back to first slide
View graphic version