搜索资源列表
g
- 计算机算法分析与设计贪心算法那章节几乎所有的实现代码 欢迎大家下载啊
Graph
- 贪心算法 ；用到图结构，栈和队列来解决哈密顿回路；输出结果：路径（每条边及其权值），总和-Greedy algorithm use graph structure,stacks and queues to solve the Hamiltonian circuit output:path (each edge and the right value),the sum
bags
- 四种算法（动态规划、回溯法、分支限界法、贪心法）实现0-1背包问题-four algorithms including dynamic planningm,tracing,branch and bound method and greedy to implement 0-1 bag problem.
danyuan
- 算法分析，单源最短路径，贪心算法实现的，非常好用-Algorithm analysis, single source shortest path, the greedy algorithm is very easy to use
Dijkstra
- 实现单元最短路径（贪心算法）的程序设计 ，算法分析与设计-Unit shortest path (greedy algorithm) program design, algorithm analysis and design