Arrows go from each prerequisite to the units that depend on it. Hover or focus a unit to highlight its path.
- Trees and forests as graphs article
- Rooted trees article
- Bounding volumes and bounding-volume hierarchies article
- Binary search trees and balanced search trees article
- B-trees and storage-oriented search trees article
- Binary heaps article
- Dijkstra's shortest-path algorithm article
- Prim's minimum-spanning-tree algorithm article
- Disjoint-set union article
- Kruskal's minimum-spanning-tree algorithm article