AlgoPlus//networking / link-state
Read the theory

Link State Routing

Flood the topology to everyone, then run Dijkstra for shortest paths.

Phase
Done
Settled
Legend
Router
Advertising / relaxing
Settled / tree edge
AI Tutor Workspace
In a nutshell
Link-state routing gives every router an identical map of the network. Each router floods a description of its own links to all the others, so everyone builds the same database. Then each independently runs Dijkstra's shortest-path algorithm on that map, producing routes that are consistent and free of loops.
Ready
Press play to begin the cinematic walkthrough.
First make sure everyone has the exact same map (flood every link to all), then each router selfishly runs Dijkstra. Shared truth means consistent, loop-free routes.
Key terms
Go deeper in the lesson
Read the full theory, intuition & complexity for Link State Routing.