您要查找的是不是：
- 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. 约束最小生成树问题研究。
- There is a recursive formula for the number of spanning trees in a graph. 对于一个图的生成树的棵数，存在一个递推公式。
- 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 relationship between bonds and cotrees is analogous to that between cycles and spanning trees. 键和余树之间的关系类似于圈和生成树之间的关系。
- The fundamental circuits relative to a spanning tree is a basis of the circ subspace. 与一生成树相关的基本圈是广义圈子空间的一个基底。
- Let G be the Cartesian product graph of paths or cycles, and let t(G) denote the number of spanning trees in ?G?. 设 G是路或圈的笛卡尔乘积图 ;t( G)表示 G的支撑树数 .
- The diameter, the number of Eulerian tours and spanning trees of this type of networks are deduced. 讨论了一种3度正则网络,这类网络具有较小的网络直径,本文给出了网络直径、网络支撑树和欧拉环游的数目的公式。
- 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. 概述了最小生成树和泛生物地理学中轨迹分析的概念。
- To enumerate all spanning trees in undirected graphs is an important problem that people frequently encounter in the analysis of network and cycle. 求无向图的生成树是在网络和回路分析中经常遇到的重要问题。
- 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? 运行生成树协议的交换网络中，何时的状态可以认为完全收敛？
