Topic: Minimum Spanning Trees

Why Prim’s Algorithm Is Correct

Why Kruskal’s Algorithm Is Correct

When Is The Minimum Spanning Tree Unique?

Weighted Graphs And The Minimum Spanning Tree Objective

Verifying A Candidate Minimum Spanning Tree

Tied Weights And Multiple Minimum Spanning Trees

The Cycle Property For Heavy Edges

The Cut Property And Its Exchange Proof

Running Time And Parallel Rounds In Boruvka’s Algorithm

Prim’s Running Time With Binary Heaps