旅行售货员算法的vc++代码实现，输入城市（定点）及城市间路径的花费（连接定点的边的权值），即可得到最少的花费和最优的旅行路线。-Traveling salesman algorithm vc++ code, enter the city (fixed) and the cost of inter-city path (connection point of the edge weights), can be obtained at least cost and optimal travel route.