您要查找的是不是：
- updating spanning tree 更新生成树
- At this point Spanning tree has fully converged. 这时生成树成功聚合。
- Virtually the only concept to be used is that of a spanning tree. 更确切地说，只使用了生成树的概念。
- Study on the Problem of Constrained Minimum Spanning Tree. 约束最小生成树问题研究。
- Evidently, the graph must be connected in order to contain a spanning tree. 显然一个图必须是连通的才能包含一生成树。
- Automatic spanning tree, but also to look for beginners, small knowledge. 自动生成树的;也是给初学者看的;小知识.
- The fundamental circuits relative to a spanning tree is a basis of the circ subspace. 与一生成树相关的基本圈是广义圈子空间的一个基底。
- Spanning Tree Failure The blocked port has gone into fowarding mode and the Spanning Tree Failure occurred. 生成树失败阻塞端口进入转发模式,生成树失败发生。
- In particular, if T is a spanning tree of G, we shall call its complement T' a cotree. 如果T是g的一棵生成树，我们称它的补集T'为一副树。
- The Knowledge Consistency Checker (KCC) was not able to build a spanning tree topology. 知识一致性检查器(KCC)无法来建立跨越树拓扑。
- Note: To disable MST, another spanning tree protocol, such as PVST+, must be configured. 注意：要禁用MST，另外一个生成树协议，像PVST+，是必须配置的
- Minimal spanning tree and the concept of track analysis of Croizat's Panbilgeography arebriefly introducted. 概述了最小生成树和泛生物地理学中轨迹分析的概念。
- The integer program model of minimal spanning tree was built up by the concepts of root and level of node in LINGO. 求解最小生成树的方法虽然很多,但是利用LINGO建立相应的整数规划模型是一种新的尝试。
- By Kruskal (Kruskal) algorithm ideas, the preparation of a minimum spanning tree of a complete search procedure. (译)：由克鲁斯卡尔（秩）算法的思想，编制一个最小生成树一个完整的搜索程序。
- Minimum spanning tree data structure source code. Hope useful for all of us. Thanks! 数据结构最小生成树源代码。希望对大家有用。谢谢！
- When is a switched network that is running the Spanning Tree Protocol considered to be fully converged? 运行生成树协议的交换网络中，何时的状态可以认为完全收敛？
- There is a recursive formula for the number of spanning trees in a graph. 对于一个图的生成树的棵数，存在一个递推公式。
- Abstract : Application layer multicast protocol sends packets to group members by the spanning tree. 摘要:应用层多播通过生成树将多播分组送至每一个组成员。
- It is assumed that the routing topology representing all the paths from one routing group to all other routing groups is a spanning tree. 用路由拓扑来表示从一个路由组到其他所有路由组的所有路径,并假定路由拓扑是一棵生成树。
- Based on separable rectilinear minimum spanning tree (SMST), optimal algorithms for rectilinear Steiner tree L_RST and optimal Z_RST are presented. 本文提出了基于可分离最小生成树(SMST)的优化L形直角斯坦(Steiner)树(L_RST)和优化Z_RST的算法。
