Computing Shortest Paths
once LSAs are reliably flooded, need to execute shortest path for all destinations
Dijkstra’s shortest path algorithm
- computes shortest paths from root (local router) to all possible destinations
- greedy algorithm which adds the least cost path to next candidate node to current shortest path set of nodes