Topic: Minimum Spanning Trees

Prim’s Adjacency-List Implementation

Prim’s Algorithm From A Starting Vertex

Kruskal’s Running Time And Sorting Costs

Kruskal’s Algorithm On A Weighted Edge List

Disjoint-Set Union In Kruskal’s Algorithm

Cuts And Crossing Edges In Weighted Graphs

Correctness And Termination Of Boruvka’s Algorithm

Comparing Kruskal, Prim, And Boruvka On Worked Graphs

Boruvka’s Algorithm By Component Merging