网络释义专业释义英英释义
... Recursive Search Techniques （回溯搜索技术） Minimum Spanning Tree （最小生成树） Knapsack （背包问题） ...
基于3个网页-相关网页
The Minimum Spanning Tree Problem 最小支撑树问题
Minimum Spanning Tree Problem 最小扩张树问题 ; 最小支撑树问题 ; [数] 最小生成树问题
Minimum Spanning Tree Algorithms 最小生成树算法
Degree-Constrained Minimum Spanning Tree 度约束最小生成树
Minimum spanning tree
- abstract: Given a connected, undirected graph, a spanning tree of that graph is a subgraph that is a tree and connects all the vertices together. A single graph can have many different spanning trees.
以上来源于: WordNet
双语例句权威例句
-
The concept of minimum spanning tree is introduced and its limitation is analyzed.
介绍了最小生成树的概念，分析了最小生成树在实际应用中的局限性。
-
The initial clustering structure is constructed by using the minimum spanning tree method.
然后使用最小生成树方法得到聚类的初始结构；
-
Algorithm design and analysis of the classic procedure, mainly 0-1 knapsack problem, such as minimum spanning tree.
算法设计与分析的经典程序，主要有0 - 1背包问题，最小生成树等。
应用推荐