graph-theory
The cut property of spanning trees
taught
Taught in
-
The cut property, previewed
Graph Theory
-
The cut property, formalized
Graph Theory
-
Why the greedy choice works
Graph Theory
-
Minimum spanning trees, revisited
Optimization
Requires
- spanning-trees required
Required by
- Kruskal's algorithm required
- Prim's algorithm 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.