最后由网桥支撑起的一棵生成树
实现了17章规定的快速生成树协议。
Implement the Rapid Spanning Tree Protocol, as specified in Clause 17.
约束最小生成树问题研究。
这时生成树成功聚合。
然后使用最小生成树方法得到聚类的初始结构；
The initial clustering structure is constructed by using the minimum spanning tree method.
对于一个图的生成树的棵数，存在一个递推公式。
There is a recursive formula for the number of spanning trees in a graph.
提出了求解度约束最小生成树问题的单亲遗传算法。
In this paper, a parthenogenetic algorithm for solving the degree-constrained minimum spanning tree problem is proposed.
本文提出一种求符号网络函数的分类生成树组方法。
This paper presents a new method of generating tree-team classification for producing symbol network functions.
键和余树之间的关系类似于圈和生成树之间的关系。
The relationship between bonds and cotrees is analogous to that between cycles and spanning trees.
由生成树的弦将运动链分解成为数目确定的基本回路。
Let the kinematics chain be resolved from the cord of spanning tree into definite numbered basic loops.
设计和实现了一种得到分布式程序的所有文件生成树的递归算法。
A realizable recursive algorism is proposed to search all the File Spanning Trees for a given program in the distributed system.
该协议通过根据网络拓扑图的最多叶子最短生成树来确定路由选择。
The routing is determined on the basis of finding a maximum leaf shortest spanning tree of the network topology.
最低优先级的网桥将被视为根结点网桥。根网桥是生成树的中心网桥。
The bridge with the lowest priority will be elected as the root bridge. The root bridge is the "central" bridge in the spanning tree.
介绍了最小生成树的概念，分析了最小生成树在实际应用中的局限性。
The concept of minimum spanning tree is introduced and its limitation is analyzed.
实验结果表明，这种用遗传算法解决度约束的最小生成树问题是有效的。
The experiment results show that it is effective on solving Degree - constrained Minimum Spanning Tree Problem.
算法设计与分析的经典程序，主要有0 - 1背包问题，最小生成树等。
Algorithm design and analysis of the classic procedure, mainly 0-1 knapsack problem, such as minimum spanning tree.
如果任意两点之间有且只有一条通路，则构成了一棵生成树。即没有网络节点是孤立的。
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.
依据树的逐步生成原理，仿照矩阵运算，提出了求解捷径问题的生成树算法。
On the progressive formation of a tree, the algorithm of solving a shortest path problem is raised in which a matrix computation is imitated.
生成树协议在一般的桥接网络中可以从逻辑上切断冗余的网络连接，避免出现网络环路。
The standard spanning tree protocol is frequently employed in a bridged network in order to deactivate redundant network connections and is intended for private local area network.
本文用最小生成树算法实现了分布式数据库中的多元连接查询，并进行了算法的分析与设计。
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.
提出了一种针对无线传感器网络的路由协议，该路由采用最小传输成本生成树的数据汇聚机制。
A routing protocol for wireless sensor networks was proposed. The protocol used a data aggregation scheme of minimum transmission cost spanning tree.
文章对网状拓扑中的虚环保护机制进行了研究，并对一种基于生成树的虚环构成算法进行了分析。
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.
大多的生成树算法（STA）失败发生由于过多的丢失BPDU导致阻塞端口转换为转发模式。
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.
首先，本文有效的分析了度受限的最小直径生成树算法-CT算法，并提出了改进的CT算法。
First, this paper analyzes degree-constraint minimum diameter spanning tree algorithm - the CT algorithm, and proposes the improved CT algorithm.
本文提出一种基于生成树、弦和路径长度的环系最小环最小集识别方法，不需事先进行环系识别。
A new method not requiring ring system information for finding SSSR based on generating tree, chord and path analysis is set up.
在分析原有基于MAC地址转发表算法的基础上，提出一种新的基于生成树协议的拓扑发现算法。
Based on the analysis of the existing algorithm of MAC address forwarding table, it presents a kind of new physical topology discovery algorithm depended on spanning tree protocol.
对邻接矩阵在图的遍历、最小生成树、拓扑排序和关键路径等算法分析上的应用作了一定的探讨。
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.
对邻接矩阵在图的遍历、最小生成树、拓扑排序和关键路径等算法分析上的应用作了一定的探讨。
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.
应用推荐