then bridges find a spanning tree.
最后由网桥支撑起的一棵生成树
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)无法来建立跨越树拓扑。
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.
如果任意两点之间有且只有一条通路，则构成了一棵生成树。即没有网络节点是孤立的。
It is assumed that the routing topology representing all the paths from one routing group to all other routing groups is a spanning tree.
用路由拓扑来表示从一个路由组到其他所有路由组的所有路径，并假定路由拓扑是一棵生成树。
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.
最小标记生成树就是其中之一，它的目标是给出一个边上带有颜色的图，计算使用颜色种类最少的生成树。
The proposed localization algorithm first generates clusters and a spanning tree consisting of cluster heads, and then the cluster head computes local coordinates of all member nodes in the cluster.
着重设计了一种基于二跳生成树的可扩展分簇定位算法。首先对传感器网络进行分簇、并利用簇头节点构造一个二跳生成树；
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)，以生成一棵全新的生成树，保证网络继续运行。
So, by measuring the ratio of the two isotopes in the rings of trees, and matching the result to the age of the ring, a history of hurricanes spanning the life of the tree can be reconstructed.
因此，通过测量树的不同年轮(ring)中两种氧同位素的比例，并将结果比对年轮所显示的树龄，就可再现树木一生中所经历的所有飓风。
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.
传统上，各个公司是通过第二层机制(如生成树)或第三层路由协议，获得城域以太网的基本弹性。
In this paper, a parthenogenetic algorithm for solving the degree-constrained minimum spanning tree problem is proposed.
提出了求解度约束最小生成树问题的单亲遗传算法。
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 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算法。
The routing is determined on the basis of finding a maximum leaf shortest spanning tree of the network topology.
该协议通过根据网络拓扑图的最多叶子最短生成树来确定路由选择。
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.
在分析原有基于MAC地址转发表算法的基础上，提出一种新的基于生成树协议的拓扑发现算法。
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.
生成树协议在一般的桥接网络中可以从逻辑上切断冗余的网络连接，避免出现网络环路。
In order to lower the scale of the problem and shorten the running time of algorithm, we propose a problem-dividing method based on minimum spanning tree to solve the TSP.
本文提出了一种基于最小生成树的TSP问题分块求解算法，以此达到降低问题的规模、缩短算法运行时间的目的。
Beginning at an initial spanning tree, the calculating of the corresponding complex systems can be obtained. A simulation example shows the usefulness of the proposed method.
针对该复杂系统可靠度的测算与决策，提出相应的解决方法，即从任何一棵初始生成树开始就可得到对应系统可靠度的方法。
Based on the characteristics of the wireless sensor networks, a data aggregation scheme of minimum transmission cost spanning tree is designed.
针对传感器网络的特点，提出了一种最小传输成本生成树的数据汇聚机制。
A routing protocol for wireless sensor networks was proposed. The protocol used a data aggregation scheme of minimum transmission cost spanning tree.
提出了一种针对无线传感器网络的路由协议，该路由采用最小传输成本生成树的数据汇聚机制。
Based on the logical structure of minimum spanning tree, a stability degree constraint model is established and the laying scheme is given.
在最小生成树逻辑结构上建立稳定性度约束模型，给出满足度约束的铺设方案。
Level diagram example shows the practicality and effectiveness of the construction theorem and counting theorem, which is a simple and easy method to construct a complete graph of the spanning tree.
平图例子验证了构造定理和计数定理的实用性和有效性，是构造一个完全图的生成树的简单易行的方法。
Level diagram example shows the practicality and effectiveness of the construction theorem and counting theorem, which is a simple and easy method to construct a complete graph of the spanning tree.
平图例子验证了构造定理和计数定理的实用性和有效性，是构造一个完全图的生成树的简单易行的方法。
应用推荐