It is assumed that the routing topology representing all the paths from one routing group to all other routing groups is a spanning tree.
用路由拓扑来表示从一个路由组到其他所有路由组的所有路径，并假定路由拓扑是一棵生成树。
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)，以生成一棵全新的生成树，保证网络继续运行。
Second, a minimum-weight spanning tree of the latter graph is computed.
其次求出后者的最小生成树；
The concept of minimum spanning tree is introduced and its limitation is analyzed.
介绍了最小生成树的概念，分析了最小生成树在实际应用中的局限性。
The initial clustering structure is constructed by using the minimum spanning tree method.
然后使用最小生成树方法得到聚类的初始结构；
In this paper, two types of the minimum weight spanning tree with constraints are investigated.
主要研究两类约束最小支撑树问题，即点约束和边约束最小支撑树问题。
Let the kinematics chain be resolved from the cord of spanning tree into definite numbered basic loops.
由生成树的弦将运动链分解成为数目确定的基本回路。
The rapid spanning tree protocol has been implemented in the application environment of the layer 3 switch.
结合第三层交换机的应用环境，实现了快速生成树协议。
Algorithm design and analysis of the classic procedure, mainly 0-1 knapsack problem, such as minimum spanning tree.
算法设计与分析的经典程序，主要有0 - 1背包问题，最小生成树等。
In this paper, a parthenogenetic algorithm for solving the degree-constrained minimum spanning tree problem is proposed.
提出了求解度约束最小生成树问题的单亲遗传算法。
The proposed model is considered as a typical partial minimum spanning tree problem from the mathematical point of view.
以寻找最短的加权送电路径为优化目标，将网络重构建模为一个寻找图的局部最小树问题，并计及各种约束。
Shortest path bridging, which is undergoing IEEE's standardization process, is meant to replace the spanning tree protocol (STP).
最短路径连接，接受IEEE的标准化过程，旨在取代生成树协议（STP）。
The bridge with the lowest priority will be elected as the root bridge. The root bridge is the "central" bridge in the spanning tree.
最低优先级的网桥将被视为根结点网桥。根网桥是生成树的中心网桥。
Based on the logical structure of minimum spanning tree, a stability degree constraint model is established and the laying scheme is given.
在最小生成树逻辑结构上建立稳定性度约束模型，给出满足度约束的铺设方案。
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.
提出了一种针对无线传感器网络的路由协议，该路由采用最小传输成本生成树的数据汇聚机制。
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.
文章对网状拓扑中的虚环保护机制进行了研究，并对一种基于生成树的虚环构成算法进行了分析。
This paper presents an extended double list storage structure based on a double list storage structure and then applies it to the minimum spanning tree algorithm.
在图的一种双链式存储结构的基础上提出了一种扩展的双链式存储结构。
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），它是通讯和网络优化设计中最为基础和重要的问题之一。
Design requirements: the use of algorithms for network Prims minimum spanning tree to the text of the various forms of output spanning tree edges and their weights.
设计要求：利用Prims算法求网的最小生成树；以文本形式输出生成树中各条边以及它们的权值。
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算法。
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问题分块求解算法，以此达到降低问题的规模、缩短算法运行时间的目的。
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 integer program model of minimal spanning tree was built up by the concepts of root and level of node in LINGO. There are particular notes to the difficulties of the model.
本文利用树根和节点级数的概念，借助于LINGO建立了求解最小生成树的整数规划模型，并对模型中的难点给出了详细的注释。
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.
生成树协议在一般的桥接网络中可以从逻辑上切断冗余的网络连接，避免出现网络环路。
The minimum spanning tree (MST) was used to obtain the best connected-component of the image set to recover the transformation between images and project the images into the Mosaic frame.
根据最小生成树(MST)算法获得图像序列的连通分量，得到图像对之间的变换矩阵并将图像映射到拼接平面。
The missiles within a group communicate by means of the nearest-neighbor topology, while communication between groups is implemented through the root nodes of the group topology spanning tree.
编队内各导弹采用相邻局部通信，编队之间则通过各编队通信拓扑生成树的根节点进行通信。
The missiles within a group communicate by means of the nearest-neighbor topology, while communication between groups is implemented through the root nodes of the group topology spanning tree.
编队内各导弹采用相邻局部通信，编队之间则通过各编队通信拓扑生成树的根节点进行通信。
应用推荐