Description: This is a dynamic programming problem, the program is seeking to achieve the shortest path map multistage procedure Tower of Hanoi and 01 knapsack problem
To Search:
File list (Check if you may need any files):
hannuota.exe
hanoi.exe
01bag.cpp
01背包问题.doc
distance.cpp
hannuota.cpp
hanoi.cpp
多段图最短路径.doc
汉诺塔递归.doc
汉诺塔非递归.doc
01bag.exe
distance.exe
说明.txt
Download