另一个Prim演算法所采用的策略称为贪婪法(greedy method)，也就是每次都是挑选最小成本的边加入最小含括树T之中，经过n-1次的挑选之后形成的累积成本必定是最小。
基于88个网页-相关网页
The principle of greedy method 贪心算法基本原理
heuristic greedy method 启发式贪心算法
greedy transform method 贪心变换法
Greedy Modular Eigenspace method 贪婪模组特征空间法
At the end of the paper, it proves that the Ant Colony Algorithm is good through comparison it to the greedy method.
并将用蚁群算法得到的结果与基于贪心策略得到的结果进行了比较，效果较好。
This paper adopts dynamic programming method and greedy method to solve such problems, then analyzes and compares the differences of two algorithms.
采用动态规划法和贪心法对该问题进行求解，分析和比较这两种算法在求解同一问题时的差异。
Through the investigation of the reconfiguration practice in a certain plant, the conclusion is attained that the greedy method based on matroid model is efficient and practicable.
针对某工厂的重组实践，经与现场结果对比证明，在快速重组制造系统的布局规划优化设计中，基于拟阵的贪馋算法是一种快捷实用的算法。
应用推荐