Introduction - If you have any usage issues, please Google them yourself
(1). Problem Description: A salesman traveling salesman problem to a number of cities to sell commodities, known distance between cities (or travel). He has to select a departure from the resident, through every city once again, and finally returned to the resident s line, bringing the total distance (or travel) the smallest. (2). Program design requirements: a. the design of a dynamic programming algorithm to an input b. any examples, can output the shortest distance and the line c. use graphical presentation of the traveling salesman selling line of input to test the file name, such as TSP6 . txt, the procedure will use dynamic programming to solve the problem, given the best lines, and graphics presentation.