片语

minimum color spanning tree最小颜色生成树

Minimum Weight Spanning Tree最小生成树

minimum spanning incoming tree最小支撑入树

minimum diameter spanning tree最小直径树

Minimum cost spanning tree game最小费用支撑树对策

Minimum Cost Spanning Tree最小生成树

minimum delay spanning tree最小延迟生成树

minimum weight spanning tree problem最小树问题

minimum labeling spanning tree最小标记生成树

英汉例句

• This paper used algorithm of minimum spanning tree to realized multi-join queries of distributed database and provided analyzing method.

  本文用最小生成树算法实现了分布式数据库中的多元连接查询，并进行了算法的分析与设计。

• 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算法求网的最小生成树；以文本形式输出生成树中各条边以及它们的权值。

• 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.

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

• 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.

  在图的一种双链式存储结构的基础上提出了一种扩展的双链式存储结构。

• 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问题分块求解算法，以此达到降低问题的规模、缩短算法运行时间的目的。

• Apply the standard tools of VGC mechanism design to solve the minimum spanning tree problem.

  文中将机制设计的标準工具VGC机制应用到解决最小支撑树问题。

• The proposed model is considered as a typical partial minimum spanning tree problem from the mathematical point of view.

  以寻找最短的加权送电路径为优化目标，将网络重构建模为一个寻找图的局部最小树问题，并计及各种约束。

• 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 capacitated minimum spanning tree problem (CMST), one of the most fundamental problems in telecommunications and in the optimal design of networks, is studied.

  研究流量约束最小生成树问题（CMST），它是通讯和网络优化设计中最为基础和重要的问题之一。

• 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 concept of minimum spanning tree is introduced and its limitation is analyzed.

  介绍了最小生成树的概念，分析了最小生成树在实际应用中的局限性。

• In this paper, a parthenogenetic algorithm for solving the degree-constrained minimum spanning tree problem is proposed.

  提出了求解度约束最小生成树问题的单亲遗传算法。

• The initial clustering structure is constructed by using the minimum spanning tree method.

  然后使用最小生成树方法得到聚类的初始结构；