usaco-guide/content/5_Gold/MST.md at 4246c9ec2094ae2cf7ff0ad12fc8c7d3e8d795bb - a/usaco-guide - exogit

a/usaco-guide

Archived

This repository has been archived on 2022-06-22. You can view files and clone it, but cannot push or open issues or pull requests.

Benjamin Qi ad104c9eff restructure most

2020-06-16 13:09:59 -04:00

2.2 KiB

Raw Blame History

id

title

author

prerequisites

mst

Minimum Spanning Trees

Benjamin Qi

Gold - Shortest Paths

Disjoint Set Union and Minimum Spanning Trees

Standard

Kattis Minimum Spanning Tree
- same as CSES Road Reparation

Tutorial

CPH 15 (Spanning Trees)
Prim's Algorithm
- cp-algo
- Similar to Dijkstra
Kruskal's Algorithm
- cp-algo 1
- cp-algo 2
- Requires "Disjoint Set Union" (DSU) data structure
  - CSAcademy Disjoint-Set
  - Topcoder Union Find
  - CPC.3
  - DSU Complexity Proofs (optional of course)
    - log*n
    - a(m,n)

USACO Gold Problems

MST
- 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 ...
DSU
- Mootube
  - same as CSES Road Construction
- Closing the Farm
- Favorite Colors
  - fairly tricky

Other Problems