Description: Dynamic algorithm of a salesman traveling salesman problem going to a number of cities to sell goods, are known to the distance between cities (or travel). He wants to select a departure from the field, through each city once again, finally back to the resident' s line, bringing the total distance (or travel) the smallest.
To Search:
File list (Check if you may need any files):
03120104旅行商问题
..................\draw.h
..................\ezd32m.lib
..................\ezdraw32.dll
..................\tsp.ncb
..................\tsp.plg
..................\TSP10.TXT
..................\TSP15.TXT
..................\TSP20.TXT
..................\readmeTSP.txt
..................\TSP4.txt
..................\TSP6.TXT
..................\TSP8.TXT
..................\Debug
..................\tsp.cpp
..................\03120104旅行商问题.doc
..................\tsp.dsp
..................\tsp.opt
..................\tsp.dsw
Download