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

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．