1·then bridges find a spanning tree.
最后由网桥支撑起的一棵生成树
2·At this point Spanning tree has fully converged.
这时生成树成功聚合。
3·Study on the Problem of Constrained Minimum Spanning Tree.
约束最小生成树问题研究。
4·The player number decreasing minimum cost spanning tree game.
局中人数目变化的最小费用支撑树对策问题。
5·Implement the Rapid Spanning Tree Protocol, as specified in Clause 17.
实现了17章规定的快速生成树协议。
6·The concept of minimum spanning tree is introduced and its limitation is analyzed.
介绍了最小生成树的概念，分析了最小生成树在实际应用中的局限性。
7·The fundamental circuits relative to a spanning tree is a basis of the circ subspace .
与一生成树相关的基本圈是广义圈子空间的一个基底。
8·The Knowledge Consistency Checker (KCC) was not able to build a spanning tree topology.
知识一致性检查器(KCC)无法来建立跨越树拓扑。
9·The initial clustering structure is constructed by using the minimum spanning tree method.
然后使用最小生成树方法得到聚类的初始结构；
10·Apply the standard tools of VGC mechanism design to solve the minimum spanning tree problem.
文中将机制设计的标准工具VGC机制应用到解决最小支撑树问题。