Description: A salesman, wants to n (n < = 10) cities to promote their products. To save travel costs, find out before his departure, arbitrary travel between two cities, would like to find a travel route through each city only once, and to travel at least. This problem is known to city n, and n* n the expression of any two cities the cost matrix. Find the shortest path and its cost
To Search:
File list (Check if you may need any files):
ETS.CPP
Download