graph-theory
Kruskal's algorithm
taught
Taught in
-
Kruskal's algorithm
Graph Theory
-
Borůvka's algorithm
Graph Theory
-
Comparing MST algorithms
Graph Theory
-
Network design as an MST problem
Graph Theory
-
Minimum spanning trees, revisited
Optimization
Requires
- the-cut-property required
Required by
- Union-find (disjoint-set) structures required
Local knowledge map
Local knowledge map
Click to expand
Solid arrows are required prerequisites; dashed are recommended or helpful. Lower rows are more foundational. Click any box to jump to that concept.