您要查找的是不是：
- At this point Spanning tree has fully converged. 這時(shí)生成樹(shù)成功聚合。
- Virtually the only concept to be used is that of a spanning tree. 更確切地說(shuō)，只使用了生成樹(shù)的概念。
- Study on the Problem of Constrained Minimum Spanning Tree. 約束最小生成樹(shù)問(wèn)題研究。
- Evidently, the graph must be connected in order to contain a spanning tree. 顯然一個(gè)圖必須是連通的才能包含一生成樹(shù)。
- Firstly, we find the resources in the breadth first search way, at the mean time, hop field is generated, and then, we schedule the resources according to the hop field. 本文提出一種新型的網(wǎng)格資源調度算法-最小跳數算法，首先通過(guò)廣度搜索遍歷找到資源，并同時(shí)生成跳數場(chǎng)，再根據跳數調度資源。
- Automatic spanning tree, but also to look for beginners, small knowledge. 自動(dòng)生成樹(shù)的;也是給初學(xué)者看的;小知識.
- The first span is a reference to a declared component; the type and parameters of the component are declared in the page's specification. 第一個(gè)span用于聲明引用一個(gè)組件:組件的類(lèi)型和參數在頁(yè)面的頁(yè)面模板中聲明。
- 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. 本文分析了深度優(yōu)先搜索方法 (DFS)和廣度優(yōu)先搜索 (BFS)方法的特點(diǎn) ,提出了一種混合使用動(dòng)態(tài)規劃方法和下界 (上界 )算法的精確求解方法求解組合優(yōu)化問(wèn)題。
- The fundamental circuits relative to a spanning tree is a basis of the circ subspace. 與一生成樹(shù)相關(guān)的基本圈是廣義圈子空間的一個(gè)基底。
- Spanning Tree Failure The blocked port has gone into fowarding mode and the Spanning Tree Failure occurred. 生成樹(shù)失敗阻塞端口進(jìn)入轉發(fā)模式,生成樹(shù)失敗發(fā)生。
- In particular, if T is a spanning tree of G, we shall call its complement T' a cotree. 如果T是g的一棵生成樹(shù)，我們稱(chēng)它的補集T'為一副樹(shù)。
- The Knowledge Consistency Checker (KCC) was not able to build a spanning tree topology. 知識一致性檢查器(KCC)無(wú)法來(lái)建立跨越樹(shù)拓撲。
- distributed breadth first search 分布式廣度優(yōu)先
- Note: To disable MST, another spanning tree protocol, such as PVST+, must be configured. 注意：要禁用MST，另外一個(gè)生成樹(shù)協(xié)議，像PVST+，是必須配置的
- Minimal spanning tree and the concept of track analysis of Croizat's Panbilgeography arebriefly introducted. 概述了最小生成樹(shù)和泛生物地理學(xué)中軌跡分析的概念。
- The integer program model of minimal spanning tree was built up by the concepts of root and level of node in LINGO. 求解最小生成樹(shù)的方法雖然很多,但是利用LINGO建立相應的整數規劃模型是一種新的嘗試。
- By Kruskal (Kruskal) algorithm ideas, the preparation of a minimum spanning tree of a complete search procedure. (譯)：由克魯斯卡爾（秩）算法的思想，編制一個(gè)最小生成樹(shù)一個(gè)完整的搜索程序。
- Minimum spanning tree data structure source code. Hope useful for all of us. Thanks! 數據結構最小生成樹(shù)源代碼。希望對大家有用。謝謝！
- When is a switched network that is running the Spanning Tree Protocol considered to be fully converged? 運行生成樹(shù)協(xié)議的交換網(wǎng)絡(luò )中，何時(shí)的狀態(tài)可以認為完全收斂？
- Abstract : Application layer multicast protocol sends packets to group members by the spanning tree. 摘要:應用層多播通過(guò)生成樹(shù)將多播分組送至每一個(gè)組成員。
