Shortest Path Routing

This routing is conceptually simple.
It is a widely used technique to build a graph of the subnet.
- Nodes: IMPs
- Arcs: Communication lines
Dijkstra’s algorithm are well-known.