用破圈法求解带权连通无向图的一棵最小代价生成树 Solving a minimum cost spanning tree with weighted connected undirected graphs by using the "breaking circle method"