联通图G的一个子图如果是一棵包含G的所有顶点的树，则该子图称为G的生成树 生成树是联通图的极小连通子图。所谓极小是指：若在树中任意增加一条边，则 将出现一个回路；若去掉一条边，将会使之编程非连通图。生成树各边的权 值总和称为生成素的权。权最小的生成树称为最小生成树，常用的算法有prime算法和kruskal算法。

-Unicom graph G is a subgraph of G is the one that contains all the vertices of the tree, the subgraph Spanning Tree Spanning Tree called G Unicom Figure minimal connected subgraph. The so-called minimal means: any tree, add an edge, then a loop　an edge if removed, will make the programming of non-connected graph. The sum of the weights of each edge of the spanning tree is called the right of erythropoietin. The right to the minimum spanning tree called the minimum spanning tree, commonly used algorithms prime algorithm and kruskal-algorithms.