此代码是基于数据结构算法分析的代码，用到图论中的深度优先收索法来求连通分支的问题，只要给出顶点、边数和相应的边就可以求出连通分支的数目-This code is based on the analysis of the code of the data structure algorithms used in graph theory depth-first closing cable method, as long as the given vertex connectivity of the branch, the number of edges and the corresponding side you can find the number of connected components