依据树的逐步生成原理，仿照矩阵运算，提出了求解捷径问题的生成树算法。
On the progressive formation of a tree, the algorithm of solving a shortest path problem is raised in which a matrix computation is imitated.
最后，给出了改进的基于划分的聚类方法，以及其中涉及到的最小生成树算法的基本思想。
Last, the partition algorithm which has been improved is proposed, meanwhile, the basic idea of Minimum Cost Spanning tree is presented.
本文用最小生成树算法实现了分布式数据库中的多元连接查询，并进行了算法的分析与设计。
This paper used algorithm of minimum spanning tree to realized multi-join queries of distributed database and provided analyzing method.
大多的生成树算法（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.
在适合数据融合的生成树算法的基础上，分析能够有效延长网络生命的最小代价生成树路由协议的原理和特点。
Consider the too much redundant data and the non-balanced energy consumption of the routing protocol based on the minimum cost, proposed a new algorithm——MHEP routing algorithm.
然后根据相关的优化理论，提出了求解时间目标数学模型的最小生成树算法和求解距离目标数学模型的最小矩形斯坦纳树算法。
According to the related optimizing theory, the Minimum Spanning Tree arithmetic and the Rectilinear SteinerMinimum Tree arithmetic were selected as the solution of the problem in this thesis.
结合粗糙集理论中的上下近似理论与图论中的最小生成树算法提出了粗糙最小生成树算法，并构造了确定性最小生成树和可能性最小生树。
Combination with upper and lower approximation of Rough sets theory and MST algorithm presents Rough MST algorithm, and constructs certain MST and uncertain MST.
该风格的算法将生成一棵树，其中树叶由采用THEN分支的任务定义。
This algorithm style will produce a tree whose leaves are defined by tasks that take the THEN branch.
文章对网状拓扑中的虚环保护机制进行了研究，并对一种基于生成树的虚环构成算法进行了分析。
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 experiment results show that it is effective on solving Degree - constrained Minimum Spanning Tree Problem.
本文研究了由MSN节点组成的应用层组播网络，提出了度约束最小直径生成树问题，并给出了求解该问题的BCT算法。
The paper studies the application layer multicast networks of MSNs, and presents a heuristic BCT algorithm for degree-constrained minimum diameter spanning tree problem.
提出一种更新移动目标最短路径树的近似算法来避免重新生成整棵路径树。
This paper presents an approximate algorithm for updating the shortest path tree of moving target to avoid re-generate the whole tree.
提出了求解度约束最小生成树问题的单亲遗传算法。
In this paper, a parthenogenetic algorithm for solving the degree-constrained minimum spanning tree problem is proposed.
因此，LTS状态树生成算法是导出软件测试计划和测试用例研究工作中的关键问题。
Thus, LTS state tree generation algorithm is the key to deriving testing plans and testing cases from architecture descriptions.
刘家壮给出了生成根树的一种算法。
Liu Jiazhuang proposed an algorithm for generating rooted trees.
以四分树为数据结构，建立了网格细分法生成自适应网格算法。
The generation algorithm of adaptive mesh which is based on the quad-tree data structure is presented.
比较的结果表明，新算法所生成的线索二叉树比传统的先序和后序线索二叉树优越。
Results of comparison show that the threaded binary-trees generated by the new method are more efficient than the traditional ones.
对邻接矩阵在图的遍历、最小生成树、拓扑排序和关键路径等算法分析上的应用作了一定的探讨。
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.
仿真结果表明，在生成树拓扑抽象中使用此逼近算法后，可大大减少源节点由于拓扑信息不准确而产生的路由决策错误数，提高网络性能。
Simulation results show that the proposed algorithm can greatly reduce the routing decision errors of the source nodes due to inaccurate topology information, and improve network performance.
算法设计与分析的经典程序，主要有0 - 1背包问题，最小生成树等。
Algorithm design and analysis of the classic procedure, mainly 0-1 knapsack problem, such as minimum spanning tree.
此平台采用分布式消息路径选择算法生成消息交换路径树，便于XML消息引擎生成一个队列和路由策略。
The M-Commerce platform USES a message path finding algorithm to create a message queue in XML message engine for routing.
基于CHAM模型，提出了通用LTS状态树生成算法，并使用实例验证了该算法。
The LTS state tree generation algorithm based on CHAM is presented, and validated with a typical in examples.
相比于传统MRA算法，该算法生成的组播树中源点到组播成员节点的平均延时大约为前者的90%。
The average delay from the source to all destinations in the tree generated by the algorithm is about 90% of the traditional MRA algorithm.
提出了一种基于分段代码自动生成产品结构树的算法。
A new segment coding-based algorithm to automatically creating product structure tree was put forward.
为提高决策的科学化程度，提出了一种改进的决策树生成算法加权id3，并将其应用于铝电解生产中出铝量的设定。
To make more scientific decision, an improved decision tree algorithm weighted ID3 is proposed and applied into the determination of aluminum tapping volume.
在《数据结构》有关图的章节中，对最小生成树两大算法的解释都是基于MST性质来说明的。
In the chapters on graphs of Data Structure, the statement to the two calculation ways of the minimal produce trees is based on the MST nature.
在《数据结构》有关图的章节中，对最小生成树两大算法的解释都是基于MST性质来说明的。
In the chapters on graphs of Data Structure, the statement to the two calculation ways of the minimal produce trees is based on the MST nature.
应用推荐