搜索资源列表
greedyl
- 数据结构与算法，贪心法求最小生成树的c语言描述算法-Data structure and algorithm, greedy method for minimum spanning tree algorithm described in the c language
StoneGame
- 编程习题石子游戏的代码，贪心法实现，c-Pebble game code, greedy method, c++
tanxin
- 经典的背包问题用贪心法实现的JAVA代码-Classical knapsack problem greedy method using the JAVA code
greedy
- 贪心法中最优量度标准的选择,是ACM队训练时看到讲义之一。-Greedy method to choose the best measure of the standard is ACM training lectures to see one.
11
- 算法设计报告，有5种算法，动态规划，贪心法，回溯法，递归，分支界限法
knapsack
- 背包问题算法 - 贪心法，递归法和动态规划法分别解决-Three solutions to Knapsack problem: the integer knapsack problem solution, fractional knapsack solution and DDG solution
jingdiansuanfa
- 经典算法+分支限界法+分治法+动态规划+贪心算法+回溯法-Classical branch and bound algorithm+ France+ divide and conquer dynamic programming+++ backtracking greedy algorithm
Huffmancoding
- 霍夫曼编码:最优子结构性质的证明方法,贪心法的设计思想并能熟练运用,前缀编码的概念，理解数据压缩的基本方法. -Huffman coding: the best evidence of the nature of sub-structure method, the greedy method of design and can skillfully use the concept of prefix code, understand the basic method of data comp
AlgorithmCode
- C++版本的各类算法源代码，包括动态规划法、分治法、贪心法、回溯法、分支限界法、概率算法-C++ source code version of the various algorithms, including dynamic programming, divide and conquer, greedy method, backtracking, branch and bound method, probability algorithm
pack_of_four_algorithms
- 01背包四种算法实现:动态规划法,分支限定法,回溯法,贪心算法-01 pack of four algorithms: dynamic programming, branch limit method, backtracking, greedy algorithm
knap
- 分支限界求背包问题相对于贪心法等有很大的优势-fenzhi xianjie beibao
tm
- 用delphi编写n*n的棋盘格的跳马问题，利用贪心法和回溯法实现，得到解的速度较快-Use delphi write n* n chessboard grid of the vault, by using greedy method and backtracking achieved by faster solutions
The_greedy_algorithm_analysis_and_design_tutorial.
- 算法分析设计之贪心法教程The greedy algorithm analysis and design tutorial-Analysis and design of the greedy algorithm tutorial The greedy algorithm analysis and design tutorial
01Knapsack
- 贪心法0-1背包问题贪 心法0-1背包问题-0/1Knapsack problem greedy Method
Cpp1
- 用动态规划和贪心法解决背包问题 问题：给定n种物品和一个背包，物品i的重量是Wi，其价值为Vi，背包的容量为c，问如何选择装入背包的物品，使得装入背包的物品的总价值最大？-=.=
tanxinfadanyuanzuidaunlujing
- 实现贪心法单源最短路径 绝对正确 算法设计与分析中贪心法的应用 环境为VC6.0-failed to translate
SpecialPacket
- 特殊的0-1背包问题求解，使用贪心法求解，有多个贪心策略。-0-1 Knapsack Problem particular, the use of greedy method, a number of greedy strategy.
shiyan4
- 使用贪心法实现最优加油问题，给定距离可加油站的位置及距离，确定加油站的次序！-Using the greedy method to achieve optimal fuel problem, given the location and distance from the station to determine the order of the gas station!
WindowsFormsApplication1
- 随机生成点的组合并找到最短遍历路径（贪心法）-Combination of randomly generated points and find the shortest traversal path (greedy method)
Prim
- 算法，写的prim算法，用的是贪心法，里面还有用到最小生成树来写的-Algorithm, written in the prim algorithm using a greedy method, there is also used to write the minimum spanning tree