Boruvkas MST algorithm

MST-Boruvka(G)
1 while |G.V| > 1
2
for each u G.V
3
for each v G.V s.t. (u,v) G.E
4
if (u,v).w < best.w
5
best = (u,v)
6
if best = null
7
error "disconnected graph"
8
else
9
add best to MST
10
for each (u,v) G.E s.t. (u,v).inMST
11
Collapse(u,v)