搜索资源列表
packa
- 用c#实现背包问题还含有课件，简单易懂，好学易用-the process use C# to solve the package problem ,it was useful
07
- 用堆栈实现0-1背包问题，以此了解递归实现的栈本质-0-1 knapsack problem with the stack implementation, in order to understand the recursive nature of stacks
gpk-update-icon.txt.tar
- 实现背包问题的最优解，linux下编程，不会让你失望的-Knapsack problem to achieve the optimal solution, linux under the program will not let you down
01package
- 关于背包问题的实现，很好的代码，希望我们一起学习。-Knapsack problem on the realization of good code, I hope we learn together.
suanfa
- 背包问题的贪心算法解决办法，用链表和栈来实现的。 -Greedy algorithm for knapsack problem
beibao
- 用java 实现 动态规划求0-1背包问题两个实例 包括改进后的算法实现-0-1 knapsack problem of the dynamic programming algorithm, 0-1 knapsack different from the knapsack problem
10_04_07-c
- 学习数据结构时候写的一些小程序，包括二分搜索、背包问题等。初学者可以下来-Data structure when learning to write small programs, including binary search, backpacks and so on. Beginners can look down. .
beibao_9
- 背包问题，经典的9个算法详细解析。每一个都有详细的讲解和代码分析-Knapsack problem, the classic algorithm detailed analysis of nine. Each with a detailed explanation and code analysis. .
bl
- tlbb 背包遍历，易语言开发，供大家学习 发源码-tlbb backpack through, easy to language development, source code for everyone to learn hair
BagZeroOne
- 用java实现0/1背包问题 贪心算法-the knapsack of using java
backnap-and-large-number-
- 使用队列类解决背包问题 和使用线性表解决俄大数计算问题-Solve the knapsack problem using the queue class, and use the linear form of large numbers to solve computational problems Russia
ep121
- 用动态规划方法模拟0-1背包的问题，并包含了文件。-Simulation using dynamic programming methods 0-1 knapsack problem, and contains the file.
beibao
- 解决简单的背包问题，大学数据结构的实验内容-Solve simple knapsack problem, the University of the data structure of the experimental content
backbag
- 设有一个能装入总体积为T的背包和n件体积分别为W1,W2,…,Wn的物品，能否从n件物品中挑选若干件恰好装满背包，即使Wi1+Wi2+…+Wm=T，要求找出所有满足上述条件的解。例如：当T=10，各件物品的体积{1,8,4,3,5,2}时，可找到4组解：(1,4,3,2)、(1,4,5)、(8,2)和(3,5,2)。-the backbag problem
KNAPSACK
- 0-1背包问题，用动态规划做的，很不错，供大家传阅。算法设计的原型。我给具体实现了。-0-1 knapsack problem, using dynamic programming to do, very good for your circulation. Algorithm design prototype. I gave a concrete realization.
0-1beibao
- 算法与分析中0/1背包问题的实现，求出最大价值及所放入的背包序号-Algorithms and Analysis 0/1 knapsack problem to achieve, find the maximum value and the serial number into the backpack
knapsack_greedy
- 贪心法解背包问题，你懂得。。。。。。。20个子真麻烦-Greedy method to solve knapsack problem, you know. . . . . . .
01
- 0-1背包问题，涉及到计算哪个背包加入了所选的结果中。-0-1 knapsack problem, which involves the calculation of the backpack to join the selected results.
beibao_fei_digui
- 背包问题的非递归程序,希望大家能用的上。-I don t know.
01Backpack
- 01背包问题的C++实现，包含Knapsack算法以及改进后的Knapsack算法。参考书籍：《算法设计与分析》。-01 knapsack problem of C++ implementation, including the Knapsack Knapsack algorithm and improved algorithm. Reference books: " Algorithm Design and Analysis."