Minimum Spanning Trees¶
Lecture date:Synopsis¶
You can create a subgraph of a graph that is a spanning tree, one that keeps the graph connected. If you minimize the edge weight while doing this we have a minimum spanning tree.
Recommended Reading¶
- Competitive Programming 3, Section 4.3