28 lines
1.1 KiB
Markdown
28 lines
1.1 KiB
Markdown
|
# Gold - Minimum Spanning Tree
|
||
|
|
|
||
|
|
* [Kattis Minimum Spanning Tree](https://open.kattis.com/problems/minspantree)
|
||
|
|
|
||
|
|
## Tutorial
|
||
|
|
|
||
|
|
- CPH 15
|
||
|
|
- Prim's Algorithm
|
||
|
|
- Similar to Dijkstra
|
||
|
|
- Kruskal's Algorithm
|
||
|
|
- Requires "Disjoint Set Union" (DSU) data structure
|
||
|
|
- [CSAcademy Disjoint-Set](https://csacademy.com/lessons)
|
||
|
|
- DSU Complexity Proofs (optional of course)
|
||
|
|
- [log\*n](https://en.wikipedia.org/wiki/Proof_of_O(log*n)\_time_complexity\_of_union%E2%80%93find)
|
||
|
|
- [a(m,n)](https://dl.acm.org/doi/pdf/10.1145/321879.321884)
|
||
|
|
|
||
|
|
## USACO Gold Problems
|
||
|
|
|
||
|
|
- MST Problems
|
||
|
|
- [Walk](http://usaco.org/index.php?page=viewproblem2&cpid=946)
|
||
|
|
- Prim's is applicable, but the edge weights are special so you don't actually need to use an MST algo ...
|
||
|
|
- [Fencedin](http://www.usaco.org/index.php?page=viewproblem2&cpid=623)
|
||
|
|
- also special ...
|
||
|
|
- DSU Problems
|
||
|
|
- [Mootube](http://www.usaco.org/index.php?page=viewproblem2&cpid=789)
|
||
|
|
- [Closing the Farm](http://www.usaco.org/index.php?page=viewproblem2&cpid=646)
|
||
|
|
- [Favorite Colors](http://www.usaco.org/index.php?page=viewproblem2&cpid=1042)
|
||
|
|
- fairly tricky
|