您要查找的是不是:
- To enumerate all spanning trees in undirected graphs is an important problem that people frequently encounter in the analysis of network and cycle. 求无向图的生成树是在网络和回路分析中经常遇到的重要问题。
- At this point Spanning tree has fully converged. 这时生成树成功聚合。
- Techniques by compound branch and network ripping to find out all spanning trees of an undirected graph 寻找无向图中全部生成树的复合支路和网络撕裂技术
- Minimum spanning tree data structure source code. Hope useful for all of us. Thanks! 数据结构最小生成树源代码。希望对大家有用。谢谢!
- It is assumed that the routing topology representing all the paths from one routing group to all other routing groups is a spanning tree. 用路由拓扑来表示从一个路由组到其他所有路由组的所有路径,并假定路由拓扑是一棵生成树。
- Virtually the only concept to be used is that of a spanning tree. 更确切地说,只使用了生成树的概念。
- Study on the Problem of Constrained Minimum Spanning Tree. 约束最小生成树问题研究。
- The Clustering takes advantage of geographic information of all nodes to adapt its cluster number, and forms the k clusters based on Minimum Spanning Tree and Kruskal Algorithm. 聚类时充分考虑到节点分布的地理信息,自适应地调节聚类的数目,再根据图论中最小生成树的理论,利用Kruskal算法将所有节点划分为k类。
- Evidently, the graph must be connected in order to contain a spanning tree. 显然一个图必须是连通的才能包含一生成树。
- all spanning tree 全部生成树
- Automatic spanning tree, but also to look for beginners, small knowledge. 自动生成树的;也是给初学者看的;小知识.
- Redundant power supplies,hot-swappable modules and Spanning Tree Protocol (STP) support are all mandatory elements of a backbone switch,as is support for emerging switch technologies,including virtual LANs. 具有冗余能力的电源、可热插拔的模块和对生成树协议(STP)的支持都是基干交换机必备的成分,实际上它支持新出现的交换技术,如虚拟局域网。
- Redundant power supplies, hot-swappable modules and Spanning Tree Protocol (STP) support are all mandatory elements of a backbone switch, as is support for emerging switch technologies, including virtual LANs. 具有冗余能力的电源、可热插拔的模块和对生成树协议(STP)的支持都是基干交换机必备的成分,实际上它支持新出现的交换技术,如虚拟局域网。
- 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. 概述了最小生成树和泛生物地理学中轨迹分析的概念。
- Grobbelaar, Hansen, McMahon, Whelan and Nicol all spanned the entire period when Dalglish and Ferguson managed the two English superpowers. 在达格利什和弗格森各自带队的那段时期,前者的手下就已经有了像格罗贝拉、汉森、麦克马洪、惠兰以及尼克尔这样的大将。