This simulator demonstrates Link State Routing using Dijkstra's shortest path algorithm. Unlike Distance Vector routing, Link State routing builds a complete map of the network topology and calculates the shortest paths from a source node to all destinations.
The example network consists of 6 nodes (routers) interconnected with weighted links representing communication costs.