图论作业中的Kruskal算法，从图的最小边开始，进行避圈式扩张，使得生成树各边权值之和为最小。-Figure of Job in the Kruskal algorithm, starting from the minimal side, to avoid the ring-type expansion, making the weight of each side of the spanning tree and minimum.