nThe routers use controlled flooding to reach every other
router in the area. Note that only newer (higher sequence
number) LSP are sent and they are not sent over the
link that they were received from.
nGiven that each router has the LSP of all the
other routers in the area, it can calculate independently what the
shortest path to each router is. The LSP describe the network topology. (Dijkstra’s algorithm)