Kruskal(G)
begin
MST ← ∅; makeSet(v) ∀v∈V
sort E by weight
for each (u,v) ∈ E do
if find(u) ≠ find(v) then
MST ← MST ∪ {(u,v)}
union(u, v)
return MST
end