Kruskal算法在连线问题中的应用

The application of Kruskal's algorithm in the connector problem

利用Kruskal算法原理,在一个赋权图中,找出具有最小权的连通生成子图即最优树.

The theory of Kruskal,s algorithm is used in a weighted graph,a connectted spanning subgraph of minimum weight is found that is called an optimal tree.