This simulator demonstrates the Distance Vector routing algorithm (also known as Bellman-Ford algorithm) used in computer networks. The algorithm allows routers to determine the shortest paths to all destinations in a network.
The example network consists of 5 nodes (routers) interconnected with weighted links representing communication costs.