tsp by greedy this project has a matrix and find min distance

通过贪心算法解决TSP问题，问题规模比较庞大时，可以快速得到解决办法，虽然和最优解有一定差距，但可以忽略-By greedy algorithm to solve TSP problems, relatively large scale of the problem, you can quickly get a solution, though, and there is a certain gap between the optimal solution, but can be ignored

这是一个用于解决TSP问题的、适用于初学者的贪心算法。-This is a used to solve the TSP problem, for beginners to greedy algorithm.