穷举法解决tsp问题 但城市数目不超过11个。-Brute-force method to solve the problem but the city tsp of not more than 11.

用遗传算法、贪心算法以及穷举法对TSP问题进行求解-Genetic algorithm, the greedy algorithm and the brute-force method to solve the TSP problem

通过模拟出一些坐标点 利用穷举法完成最短路径的小型tsp问题的解决方案 为最优解-By simulating some coordinates using the brute-force method to complete the shortest path problem for small tsp solution for the optimal solution