Kruskal’s Algorithm for Minimum Spanning Trees
Yet another greedy algorithm:
Initialize all vertices to unconnected
While there are still unmarked edges
Pick the lowest cost edge e = (u, v) and mark it
If u and v are not already connected, add e to the minimum spanning tree and connect u and v