Spanning trees
0:00 · Watch on YouTube
The video proves that greedy works for minimum spanning trees by first establishing cardinality duality between maximal forests and minimal spanning sets, then characterizing good edges that must belong to every MST.