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 除这些外，用户还可以采取其他途径，如快速生成树。
M sequence has several constructive methods such as cut - joining , spanning tree , the selected method , the induced method and so on M序列的构造方法有剪接法，升级法，选定法以及诱导法等。
Concept and implement of graph , basic operations of graph , minimum cost spanning tree , shortest path problem , aov and aoe network 图的概念和实现；图的基本操作；最小价值生成树；最短路径；活动网络。
This problem refers to constructing minimum - cost spanning trees constrained by delay , which is known to be np - complete 该问题的目标是创建一棵覆盖源节点和目的节点的代价最小树,且满足端到端时延要求。
