spanning tree的例句大全

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

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

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.

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

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精简算法、新的文件生成树生成算法、文件传输路径生成算法以及响应时间评估算法。

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

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

In addition, by studying the traffic flow distribution rule in the minimum spanning tree, it is found that the proportion of the minimum spanning tree in the total system is close to a constant.

此外，通过研究最小支撑树上的流量分布规律，发现最小支撑树上流量占总系统流量的比例接近于一个常数。

on the edge reconstruction conjecture& the complete set of spanning tree coordinates of a connected graph

边重构问题&连通图的支撑树系列基边向量总表

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

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

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.

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

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

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

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树的重点在于确定辅助点数目和位置与度约束的处理两方面。

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.

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

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

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

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

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

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.

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

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.

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

minimum spanning tree algorithm based on extended double list storage structure

基于扩展双链式存储结构的最小生成树算法

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

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

on the one hand, the algorithm uses the spanning tree protocol ( stp) to discover topology; on the other hand, it determines the connection among the switches, sharing network segment, and non-managerial switches with the fdb.

一方面，利用生成树协议STP来进行拓扑发现；另一方面，通过地址转发表信息来辅助确定子网中交换机与共享网段、不可网管交换机之间的连接关系。

the integer program model of minimal spanning tree was built up by the concepts of root and level of node in lingo.

求解最小生成树的方法虽然很多，但是利用LINGO建立相应的整数规划模型是一种新的尝试。

discussions about the two algorithms for finding the minimal spanning tree of an undirected weighted graph

求无向赋权图最小生成树的两种算法的探讨