Arrows go from each prerequisite to the units that depend on it. Hover or focus a unit to highlight its path.
- Paths, cycles and connectedness in graphs article
- Weighted graphs and path cost article
- Dijkstra's shortest-path algorithm article
- Link-state routing article
- Bellman-Ford shortest paths and negative cycles article
- Distance-vector routing article
- Minimum spanning trees article
- Kruskal's minimum-spanning-tree algorithm article
- Prim's minimum-spanning-tree algorithm article