Description: Traveling salesman problem (TSP problem) is a vendor from the n cities, starting in a city, do not finish the rest of repeated n-1 cities and return to the original starting point, calculate all possible paths in the shortest path length one. This question assumes that the traveling salesman starting from a city.
To Search:
- [TSPMach] - A Star source algorithm for TSP problem,
- [OfficeVBA] - Understanding in Office, VBA automation
File list (Check if you may need any files):
TravelerTSP.cpp
Download