Implement the Rapid Spanning Tree Protocol, as specified in Clause 17.
实现了17章规定的快速生成树协议。
The concept of minimum spanning tree is introduced and its limitation is analyzed.
介绍了最小生成树的概念，分析了最小生成树在实际应用中的局限性。
The fundamental circuits relative to a spanning tree is a basis of the circ subspace .
与一生成树相关的基本圈是广义圈子空间的一个基底。
The Knowledge Consistency Checker (KCC) was not able to build a spanning tree topology.
知识一致性检查器(KCC)无法来建立跨越树拓扑。
The initial clustering structure is constructed by using the minimum spanning tree method.
然后使用最小生成树方法得到聚类的初始结构；
Let the kinematics chain be resolved from the cord of spanning tree into definite numbered basic loops.
由生成树的弦将运动链分解成为数目确定的基本回路。
The experiment results show that it is effective on solving Degree - constrained Minimum Spanning Tree Problem.
实验结果表明，这种用遗传算法解决度约束的最小生成树问题是有效的。
According to the character of the problem, a DNA algorithm solving the Minimum Spanning Tree problem is given.
根据问题的特征，提出了一个求解最小支撑树问题的DNA算法。
The routing is determined on the basis of finding a maximum leaf shortest spanning tree of the network topology.
该协议通过根据网络拓扑图的最多叶子最短生成树来确定路由选择。
Algorithm design and analysis of the classic procedure, mainly 0-1 knapsack problem, such as minimum spanning tree.
算法设计与分析的经典程序，主要有0 - 1背包问题，最小生成树等。
It's a spanning tree if there's also at least one path between any two points, i.e., no network nodes are left unconnected.
如果任意两点之间有且只有一条通路，则构成了一棵生成树。即没有网络节点是孤立的。
In this paper, a parthenogenetic algorithm for solving the degree-constrained minimum spanning tree problem is proposed.
提出了求解度约束最小生成树问题的单亲遗传算法。
The bridge with the lowest priority will be elected as the root bridge. The root bridge is the "central" bridge in the spanning tree.
最低优先级的网桥将被视为根结点网桥。根网桥是生成树的中心网桥。
This paper used algorithm of minimum spanning tree to realized multi-join queries of distributed database and provided analyzing method.
本文用最小生成树算法实现了分布式数据库中的多元连接查询，并进行了算法的分析与设计。
It is assumed that the routing topology representing all the paths from one routing group to all other routing groups is a spanning tree.
用路由拓扑来表示从一个路由组到其他所有路由组的所有路径，并假定路由拓扑是一棵生成树。
First, this paper analyzes degree-constraint minimum diameter spanning tree algorithm - the CT algorithm, and proposes the improved CT algorithm.
首先，本文有效的分析了度受限的最小直径生成树算法-CT算法，并提出了改进的CT算法。
If one of the active connections fails, the spanning tree protocol (STP) is executed again to create a new spanning tree so the network keeps running.
如果有一个活动链接失效了，就再执行一次生成树协议(spanningtree protocol,STP)，以生成一棵全新的生成树，保证网络继续运行。
A routing protocol for wireless sensor networks was proposed. The protocol used a data aggregation scheme of minimum transmission cost spanning tree.
提出了一种针对无线传感器网络的路由协议，该路由采用最小传输成本生成树的数据汇聚机制。
Most of the Spanning Tree Algorithm(STA) failures occur due to the excessive loss of BPDUs causing the blocked ports to transition to forwarding mode.
大多的生成树算法（STA）失败发生由于过多的丢失BPDU导致阻塞端口转换为转发模式。
This paper studied the protection mechanism for virtual ring in mesh topology, and analyzed a construction algorithm for a virtual ring based on spanning tree.
文章对网状拓扑中的虚环保护机制进行了研究，并对一种基于生成树的虚环构成算法进行了分析。
The proposed algorithm, TABU-Clustering, is com - posed of three stages: minimum spanning tree clustering, recombination of clusters and tabu search optimization.
该算法包括三个阶段：最小生成树聚类、聚类簇重组和禁忌搜素优化。
The capacitated minimum spanning tree problem (CMST), one of the most fundamental problems in telecommunications and in the optimal design of networks, is studied.
研究流量约束最小生成树问题（CMST），它是通讯和网络优化设计中最为基础和重要的问题之一。
Companies traditionally have gained basic resiliency for their metropolitan Ethernet networks through a Layer 2 mechanism such as Spanning Tree or Layer 3 routing protocols.
传统上，各个公司是通过第二层机制(如生成树)或第三层路由协议，获得城域以太网的基本弹性。
A new real-time reconfiguration approach for large-scale distribution system, based on the minimum spanning tree algorithm and the switch exchange method, is presented.
提出了一种利用最小树算法和开关交换方法进行大规模配电网重构的新方法。
The paper studies the application layer multicast networks of MSNs, and presents a heuristic BCT algorithm for degree-constrained minimum diameter spanning tree problem.
本文研究了由MSN节点组成的应用层组播网络，提出了度约束最小直径生成树问题，并给出了求解该问题的BCT算法。
This paper discusses the application of adjacency matrix at the algorithm's analysis for traversing Graph, Minimum cost Spanning Tree, Topological sort and Critical Path.
对邻接矩阵在图的遍历、最小生成树、拓扑排序和关键路径等算法分析上的应用作了一定的探讨。
The minimum labeling spanning tree(MLST) problem is an NP-hard problem in which, given a graph with labeled edges, one seeks a spanning tree with the least number of labels.
最小标记生成树就是其中之一，它的目标是给出一个边上带有颜色的图，计算使用颜色种类最少的生成树。
This paper intends to discuss the way to construct the spanning tree, on which the algorithm for routing protocol, which is the kernel of the IP multicasting, shall be analyzed.
本文作者分析讨论了组播路由协议的生成树构建方法，在此基础上进一步对IP组播技术中核心的组播路由协议和算法进行了分析。
This paper intends to discuss the way to construct the spanning tree, on which the algorithm for routing protocol, which is the kernel of the IP multicasting, shall be analyzed.
本文作者分析讨论了组播路由协议的生成树构建方法，在此基础上进一步对IP组播技术中核心的组播路由协议和算法进行了分析。
应用推荐