Description: Divide and conquer, solved using dynamic programming algorithm to achieve the 0-1 knapsack problem process dynamic demonstration algorithm. The demonstration interface is friendly and vivid, and it is easy to understand the algorithm.
To Search:
File list (Check if you may need any files):
4解释.doc
code.txt
图的算法演示.exe
提交图的算法演示系统
....................\code.txt
....................\PointData.txt
....................\图的算法演示.exe
Download