minimal spanning tree algorithm

minimal spanning tree algorithm 基本解释

网络  最小生成树算法

计算机

重点词汇

• algorithmn. 算法 [计] 算法
• treen. 树, 木料, 树状物 vt. 把...赶上树 [计] 树; DOS外部命令:显示指定磁盘驱动器的目录结构
• minimala. 最小的, 极微的, 最小限度的 [医] 最小的, 最低的
• spanning[计] 生成

minimal spanning tree algorithm 双语例句

1. 1、 Image edge detection using new weighted entropy minimal spanning tree algorithm
   最小加权熵支撑树图像边缘提取方法
2. 2、 A Minimal Spanning Tree based Graph Indexing Algorithm
   基于最小生成树的图数据库索引算法
3. 3、 The two algorithms for finding the minimal spanning tree of an undirected weighted graph are PRIM algorithm and KRUSKAL algorithm.
   对求无向赋权图最小生成树两种算法分别是PRIM算法和KRUSKAL算法。
4. 4、 Optimal distribution network planning based on improved minimal cost spanning tree algorithm and considering indeterminacy of power loads
   基于改进最小生成树算法并考虑负荷不确定性的配电网架最优规划
5. 5、 A Key-node Based Dynamic Heuristic Minimal Spanning Tree Multicast Routing Algorithm
   基于关键节点的动态多播最小生成树算法
6. 6、 This paper extends the heuristic algorithm for network design from one dimensional space into two dimensional space, taking minimal spanning tree as initial network, thus suggesting a heuristic algorithm which can be used efficiently for centralized netwo
   本文把网络设计的试探算法从一维空间扩展到二维空间，用最小生成树作为起始网，提出了一种便于以时延为约束条件的网络设计试探算法。
7. 7、 The article introduces prim algorithm of minimal spanning tree, the realization of minimum function and the influence which the function makes upon minimal spanning tree gotten by prim algorithm.
   本文介绍了最小生成树的prim算法，minimum函数的实现过程及该函数对由prim算法所得到的最小生成树的影响。