Kruskal's Minimum Spanning Tree
for each v ∈ G.V Make-Set(v) for each (u,v) by weight if Find-Set(u) ≠ Find-Set(v) Union(u,v) (u,v).inMST = True