您要查找的是不是:
- 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 first span is a reference to a declared component; the type and parameters of the component are declared in the page's specification. 第一个span用于声明引用一个组件:组件的类型和参数在页面的页面模板中声明。
- The fundamental circuits relative to a spanning tree is a basis of the circ subspace. 与一生成树相关的基本圈是广义圈子空间的一个基底。
- A hybrid algorithm combined with dynamic programming and the lower bound (or upper bound) algorithm is proposed. It is on the basis of analysing the depth first search (DFS) and the breadth first search (BFS) methods. 本文分析了深度优先搜索方法 (DFS)和广度优先搜索 (BFS)方法的特点 ,提出了一种混合使用动态规划方法和下界 (上界 )算法的精确求解方法求解组合优化问题。
- By making use of these rules, graph's depth first search recursive algorithm and n-order Legendre polynomial recursive algorithm are (converted) to equivalent non-recursive algorithms. 利用该组规则将图的深度优先搜索(DFS)和n阶勒让德多项式的递归算法转换成了等价的非递归算法.
- Spanning Tree Failure The blocked port has gone into fowarding mode and the Spanning Tree Failure occurred. 生成树失败阻塞端口进入转发模式,生成树失败发生。
- Combined with AI theory, an algorithm for recognizing the energized state of telecontrol system of electric railway feeding lines is proposed based on a heuristic depth first search approach. 算法实现了牵引供电远动系统线路带电推导,对该算法进行了理论分析,并给出了实现该算法的控制策略及软件框图。
- 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建立相应的整数规划模型是一种新的尝试。
- depth first left most ergodic algorithm 深度优先最左遍历
- 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? 运行生成树协议的交换网络中,何时的状态可以认为完全收敛?