|
Graph Boruvka(Graph G)
while (T.size < n for u <tex>\in</tex> G u.color = 0 minEdge[u] = MAX_EDGE //MAX_EDGE ребро весом бесконечности for u <tex>\in</tex> G if !u.color dfs(u, color++) for (uv <tex>\in</tex> E) if (u.color != v.color) if (minEdge[u.color] < uv.w) minEdge[u.color] = uv.w if (minEdge[v.color] < uv.w) minEdge[v.color] = uv.w) for (color) T.addEdge(minEdge[color]) for (u <tex>\in</tex> G) dfsif minEdge[u] != MAX_EDGE T.addEdge(minEdge[u, color++])
return T;
