文件名称:2233111
介绍说明－－下载内容均来自于网络，请自行研究使用
采用分治法、动态规划算法实现0-1背包问题的求解；动态演示算法的的实现过程。要求演示界面友好、生动，易于对算法的理解-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.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
4解释.doc
code.txt
图的算法演示.exe
提交图的算法演示系统
....................\code.txt
....................\PointData.txt
....................\图的算法演示.exe