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
- Trees and forests as graphs article
- Backtracking search article
- Layer-2 loops and spanning-tree forwarding article
- Minimum spanning trees article
- Kruskal's minimum-spanning-tree algorithm article
- Rooted trees article
- Binary search trees and balanced search trees article
- Binary heaps article
- Prim's minimum-spanning-tree algorithm article