搜索资源列表
beibao
- 用回溯法求解0-1背包问题 用vc++实现 包含完整源代码 经过测试成功!
beibao
- 通过贪心算法实现背包问题,可实现小规模背包问题-Through the greedy algorithm knapsack problem, enabling small-scale knapsack problem
beibao
- 实现背包问题,可以直接运行!!!!欢迎下载-Knapsack problem to achieve, you can directly run! ! ! ! Welcome to download
beibao
- 经典的背包问题,用C++语言,可以自行设定背包数和限重,值得参考哦-Classic knapsack problem, using C++ Language, can be set and limit the number of heavy backpack, it is also useful Oh
beibaoVC6
- VC6实现背包问题,内容详实,易懂,非常适合初学者-VC——beibao
beibao
- 算法实验C++编程用回溯法解决01背包问题-Experimental C++ programming algorithm with backtracking to solve 01 backpack
beibao
- 背包问题!给定几个不同的载重物体,以及利润!得出最优解。-Knapsack problem! For a given load several different objects, and profit! Reached the optimal solution.
knap
- 分支限界求背包问题相对于贪心法等有很大的优势-fenzhi xianjie beibao
beibao
- 这是一个关于背包问题的解法,里面包含了源代码,请仔细研究-some example
beibao
- 帮助你学习c++,能跟好的理解c++语言的作用 -good code help you learn c++ program
beibao
- 用简单的c语言实现简单的01背包程序源代码,方法比较简单。-Simple c language the the 01 backpack program source code, the method is relatively simple.
beibao
- 实验,背包问题贪心算法。使装入背包的物品的价值最大。-Experiments, the greedy algorithm knapsack problem.
beibao
- 0-1背包问题,实现对一组货物价值最大化的筛选,应用排序和贪心算法实现。-0-1beibao problem
beibao
- 背包问题 C++ knapsack problem -The realization of the knapsack problem C++
beibao
- 背包问题并行算法MPI源程序 并行思想加快速度-Parallel algorithm knapsack problem thinking speed parallel MPI source
beibao-2
- 二维数组解决背包问题,不是十分经典,但对初学者十分有用-Two-dimensional array to solve knapsack problem, not very classic, but very useful for beginners
beibao
- 帮助你学习c++,能跟好的理解c++语言的作用-good code help you learn c++ program
beibao
- c++实现的背包问题代码,可能不全,但是是自己写的,有需要的可以参考一下-c++ backpack problem
beibao
- 背包问题源代码,有详细的注释,逻辑比较清楚。-Knapsack problem source code
Beibao
- 实现背包问题,在限定的总重量内,我们如何选择,才能使得物品的总价格最高-Achieve knapsack problem, within a limited total weight, how we choose to make the total price of the highest items