用某种方法选择n-1条边使它们形成G的最小生成树。至少可以采用三种不同的贪婪策略来选择这n-1条边。(Choose n-1 edges in some way so that they form the minimum spanning tree of G. At least three different greedy strategies can be used to select this n-1 edge.)