摘要
文章简单介绍了算法的基本思想,讲述了贪心算法的含义,探讨并研究了贪心算法的基本思想及实现过程,介绍了两种体现"贪心"思想的图形算法:克鲁斯卡尔算法(Kruskal)和普利姆(Prim)算法,并通过实例分析了贪心算法的具体应用,指出了贪心算法的特点及存在问题。
This paper introduces the basic idea of the algorithm,describes the meaning of the greedy algorithm to explore and study the basic idea of greedy algorithm and implementation process,describes two embody the "greedy" thought the graphics algorithms:Kruskal algorithm(Kruskal) and the Plym(Prim) algorithm and an example of a specific application of the greedy algorithm,a greedy algorithm that the characteristics and problems.
出处
《电脑知识与技术（过刊）》
2011年第1X期444-446,共3页
Computer Knowledge and Technology
关键词
贪心算法
贪心策略
贪心选择
最优子结构
最优解
greedy algorithm
greedy strategy
greedy selection
optimal substructure
the optimal solution
