Lecture 12: Minimum Spanning Trees

Content locked

The catalog is public. Reading this content requires approved access.

Greedy choices and the MST problem

Edge exchange and the cut property

Prim’s algorithm: grow one tree

Priority-queue implementation

Kruskal’s algorithm: grow a forest

Disjoint sets and union by size

Amortized analysis