1.5 KiB
1.5 KiB
| id | title | author | prerequisites | description | ||
|---|---|---|---|---|---|---|
| mst | Minimum Spanning Trees | Benjamin Qi |
|
A subset of the edges of a connected, undirected, edge-weighted graph that connects all the vertices to each other of minimum total weight, where no cycles are allowed. |
Standard
Tutorial
USACO Gold Problems
- Old Silver - SuperBull
- Walk
- Prim's is applicable, but the edge weights are special so you don't actually need to use an MST algo ...
- Fencedin
- also special ...