根据贪心算法，来求解最小生成树；

这种情况，可能求不不全局最优解，但是，可以求出当前情况下的最优解；-According to greedy algorithm to solve the minimum spanning tree　this situation, it may not seek the global optimal solution is not, however, you can find the optimal solution under the current situation