Description: For dynamic programming problem traveling salesman, you can change its end and start, and you can change it through the point of the problem
To Search:
File list (Check if you may need any files):
行商问题的动态规划算法
......................\dynamic_programming_about_travel.dsp
......................\dynamic_programming_about_travel.dsw
......................\dynamic_programming_about_travel.ncb
......................\dynamic_programming_about_travel.plg
......................\travel.cpp
......................\dynamic_programming_about_travel.opt
Download