其次求出后者的最小生成树；
Second, a minimum-weight spanning tree of the latter graph is computed.
约束最小生成树问题研究。
然后使用最小生成树方法得到聚类的初始结构；
The initial clustering structure is constructed by using the minimum spanning tree method.
计算距离最小生成树完整的源代码，已经过测试。
Calculates the distance in minimal spanning trees complete source code, has been tested.
提出了求解度约束最小生成树问题的单亲遗传算法。
In this paper, a parthenogenetic algorithm for solving the degree-constrained minimum spanning tree problem is proposed.
该算法包括三个阶段：最小生成树聚类、聚类簇重组和禁忌搜素优化。
The proposed algorithm, TABU-Clustering, is com - posed of three stages: minimum spanning tree clustering, recombination of clusters and tabu search optimization.
介绍了最小生成树的概念，分析了最小生成树在实际应用中的局限性。
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.
在最小生成树逻辑结构上建立稳定性度约束模型，给出满足度约束的铺设方案。
Based on the logical structure of minimum spanning tree, a stability degree constraint model is established and the laying scheme is given.
最后，给出了改进的基于划分的聚类方法，以及其中涉及到的最小生成树算法的基本思想。
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.
在《数据结构》有关图的章节中，对最小生成树两大算法的解释都是基于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.
对邻接矩阵在图的遍历、最小生成树、拓扑排序和关键路径等算法分析上的应用作了一定的探讨。
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.
研究流量约束最小生成树问题（CMST），它是通讯和网络优化设计中最为基础和重要的问题之一。
The capacitated minimum spanning tree problem (CMST), one of the most fundamental problems in telecommunications and in the optimal design of networks, is studied.
设计要求：利用Prims算法求网的最小生成树；以文本形式输出生成树中各条边以及它们的权值。
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.
本文考虑到节点度的代价问题，提出了广义最小生成树的概念，并分析了最小生成树在实际应用中的局限性。
In this paper, considering the cost of the node degree, a Generalized Minimum Spanning Tree modal is presented.
根据最小生成树(MST)算法获得图像序列的连通分量，得到图像对之间的变换矩阵并将图像映射到拼接平面。
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.
本文提出了一种基于最小生成树的TSP问题分块求解算法，以此达到降低问题的规模、缩短算法运行时间的目的。
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.
我们在最小生成树的两个组中推断出一些古老单倍型，并推测在冰期时湖北和我国的西南地区可能是该物种的避难所。
Furthermore, older haplotypes were detected in the two groups, respectively. Possible refugia are inferred in western Hubei Province and SW China during the glacial period.
我认为，基本上有4种因素影响人们的购买选择：成本，考绩可靠性和能源消耗量(最小生成树一辆汽车的整个生命)。
In my opinion, there are basically 4 factors effecting people's purchase choices: cost, performance, reliability and energy consumption (cost spanning a car's whole life).
然后根据相关的优化理论，提出了求解时间目标数学模型的最小生成树算法和求解距离目标数学模型的最小矩形斯坦纳树算法。
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.
本文利用树根和节点级数的概念，借助于LINGO建立了求解最小生成树的整数规划模型，并对模型中的难点给出了详细的注释。
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.
然而，在这样的聚类算法，对最近在最小生成树建设邻居搜索是计算的主要来源和标准的解决方案采取的O (N - 2)的时间。
However, in such clustering algorithms, the search for nearest neighbor in the construction of minimum spanning trees is the main source of computation and the standard solutions take o (N-2) time.
结合粗糙集理论中的上下近似理论与图论中的最小生成树算法提出了粗糙最小生成树算法，并构造了确定性最小生成树和可能性最小生树。
Combination with upper and lower approximation of Rough sets theory and MST algorithm presents Rough MST algorithm, and constructs certain MST and uncertain MST.
结合粗糙集理论中的上下近似理论与图论中的最小生成树算法提出了粗糙最小生成树算法，并构造了确定性最小生成树和可能性最小生树。
Combination with upper and lower approximation of Rough sets theory and MST algorithm presents Rough MST algorithm, and constructs certain MST and uncertain MST.
应用推荐