spanning tree

Understand the main purpose of the Spanning Tree Protocol in a switched LAN.

理解生成树协议在交换式LAN中的主要用途.

Research on Minimum Spanning Tree Solved by VGC Mechanism

基于VGC机制的最小支撑树问题研究

Then using Kruskal algorithm, a maximum weight spanning tree is constructed from complete datasets, and based on initial order of node, the orientation of edges is adjusted.

基于初始化后的完整数据，应用克鲁斯卡尔算法建立最大权重生成树，并按照上述的节点次序确定生成树中边的方向。

Apply the standard tools of VGC mechanism design to solve the minimum spanning tree problem.

文中将机制设计的标准工具VGC机制应用到解决最小支撑树问题。

A root bridge is elected as the root of the spanning-tree topology.

生成树拓扑内的网桥共同选举出根网桥.

The routing is determined on the basis of finding a maximum leaf shortest spanning tree of the network topology.

该协议通过根据网络拓扑图的最多叶子最短生成树来确定路由选择。

Heuristic and exact algorithms for the constraint minimum Wight spanning tree problem

约束最小权生成树的近似算法和分枝定界算法

Virtually the only concept to be used is that of a spanning tree.

更确切地说,只使用了生成树的概念.

It is a spanning-tree because all devices in the network are reachable or spanned.

因为网路上所有装置都是可到达的或是可扩展的,所以称为扩充树.

In this paper, it proposes an extended trading service, which manages a trader federation dynamically. With extended trading service, optimized links between traders are automatically set up thanks to the use of minimum-weight spanning tree.

该文扩展了交易服务，从而对交易者联邦进行动态管理，并使用最小生成树对交易者联邦间的连接进行了优化。

When the terminal moves, takes part in or exits the multicast group, routing spanning tree should be also changed.

终端移动或加入、退出组播组时，路由生成树应随之动态变化。

Minimum cost k-degree constrained spanning tree game

最小费用k度限制树对策

Third, an efficient enumeration algorithm is proposed for solving the constrained minimum spanning tree problem.

第三, 对带约束的最小生成树问题给出了一种有效的枚举算法.

Combining with the method of minimum spanning tree in Graph theory, we present two concepts of similarity and contact degree in this paper, and build a new attribute clustering algorithm based on them.

结合图论中的最小张树方法，提出了相似度以及接触度两个概念，并以此为基础建立了一种属性聚类算法。

Select ports are part of the spanning tree , the designated ports . Non-designated ports are blocked.

选指定端口和非指定端口, 非 指定端口被阻塞.

Automatic spanning tree, but also to look for beginners, small knowledge.

自动生成树的, 也是给初学者看的, 小知识.

A multi-stage planning approach considering uncertainty is put forward based on improved minimum-cost spanning tree algorithm.

为了在规划过程中考虑负荷的不确定性,提出了一种基于改进最小生成树算法的多阶段不确定性规划方法.

Table Operations Method for Minimum Spanning Tree Problem in Weighted Digraph

赋权有向图最小生成树的表上作业法

Approximating the Directed Minimum Degree Spanning Tree of Directed Acyclic Graph The trouble with the profit system has always been that it has highly unprofitable to most people.

有向无环图最小度生成树问题的一种近似算法利润制度的最大弊病始终是绝大多数的人是绝对无利可图的。

Using matlab language Kruskal minimum spanning tree algorithm for general-purpose source.

用matlab语言编写的最小生成树kruskal算法的通用源程序.

At this point Spanning tree has fully converged.

这时生成树成功聚合.

Irrespective of this, the user can still resort to standards such as Rapid Spanning Tree.

除这些外, 用户还可以采取其他途径,如快速生成树.

Each port on a switch that uses the Spanning-Tree Protocol has one of five states, Figure.

使用扩充树协定的交换器,每个埠有五种状态, 如图所示.

And the emphasis of solving Manhattan distance Steiner minimum spanning tree under horizontal plane degree constraint is on two aspects, to determine the number and location of auxiliary point and degrees of processing.

而解决水平面上度约束下的曼哈顿距离Steiner树的重点在于确定辅助点数目和位置与度约束的处理两方面。

It mainly includes: the main crotches identification based on minimal spanning tree, which is generated from contracted point cloud, and the global scalar field of sampling radii.

主要体现在：利用由收缩后点云生成的最小生成树识别出主要树权点，进而计算出全局的采样半径标量场。

A polynomial algorithm for finding a spanning tree with maximum degree constraint in K 1, r Free Graphs

K（1，r）－free图的次限制树多项式算法

The minimum cost k-degree constrained spanning tree game.

最小费用k度限制支撑树对策问题。

These algorithms include Degree-1 reduction algorithm, Series reduction algorithm, new file spanning tree algorithm, file transmission path algorithm and response time of file transmission path algorithm.

在此基础上，推导出Degree-1精简算法、Series精简算法、新的文件生成树生成算法、文件传输路径生成算法以及响应时间评估算法。

The concept of minimum spanning tree is introduced and its limitation is analyzed.

介绍了最小生成树的概念,分析了最小生成树在实际应用中的局限性.

This topology is the spanning-tree of the network.

这种拓扑是扩充树的网路.