最小生成树，就是给定一个无向图，挑选若干条边，连成一个树行图（无圈），使得所选边的权至和最小。运用的是Kruskal算法。-Minimum spanning tree, that is, given an undirected graph, choose several edge, into a tree line graph (no ring), making minimal rights to the selected edge