设计用并查集来计算一个无向图的连通分支的算法。 对于给定的无向图G，用并查集计算无向图G 的连通分支。 -Design and a search set to calculate the connectivity of undirected graph branch algorithm. For a given undirected graph G, and Richard set calculated using undirected graph G branch connectivi