An algorithm for finding minimum spanning trees and comparison with other algorithm 求最小生成树的另一算法及其与其它算法的比较
Minimum spanning tree 最小生成树
The application and analyze about the algorithm of minimum spanning tree in multi - join 最小生成树算法在多元连接中的应用及算法分析
On the models of graph theory based on minimum spanning tree with applications in medicine 基于最小生成树的图论模型及其在医学中的应用
In particular , if t is a spanning tree of g , we shall call its complement t ' a cotree 如果t是g的一棵生成树，我们称它的补集t '为一副树。
Irrespective of this , the user can still resort to standards such as rapid spanning tree 除这些外，用户还可以采取其他途径，如快速生成树。
Series of numerical examples are tested and the results are compared with that of some other algorithms 在最小生成树的基础上，将超过度约束的顶点降低度数使之满足度约束条件。
To set the priority of a spantree in an instance , use the set spantree priority priority mst instance command 去设置生成树的优先级在势力中，使用设置生成树优先级优先mst实例命令。
Concept and implement of graph , basic operations of graph , minimum cost spanning tree , shortest path problem , aov and aoe network 图的概念和实现；图的基本操作；最小价值生成树；最短路径；活动网络。
At the same time , a fast heuristic algorithm of mimimum cost tree with delay constraint are presented , its time complexity is ( pn2 ) 同时还提出了一种满足延迟约束的多播最小生成树算法（时间复杂度为( pn2 ) ） 。
