1、The Knowledge Consistency Checker was not able to build a spanning tree topology.
知識(shí)一致性檢查器(KCC)無法來建立跨越樹拓?fù)洹?/p>

2、At this point Spanning tree has fully converged.
這時(shí)生成樹成功聚合。

3、The initial clustering structure is constructed by using the minimum spanning tree method.
然后使用最小生成樹方法得到聚類的初始結(jié)構(gòu)；

4、The fundamental circuits relative to a spanning tree is a basis of the circ subspace.
與一生成樹相關(guān)的基本圈是廣義圈子空間的一個(gè)基底。

5、The player number decreasing minimum cost spanning tree game.
局中人數(shù)目變化的最小費(fèi)用支撐樹對(duì)策問題。

6、Understanding Spanning Tree Protocol STP configuration and principle.
理解生成樹協(xié)議STP的配置及原理。

7、Application of Minimum spanning tree in Ventilating Network
最小生成樹在通風(fēng)網(wǎng)路中的應(yīng)用

spanning tree翻譯