Description: 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
To Search:
File list (Check if you may need any files):
tsp贪心\Debug\tsp贪心.exe
.......\.....\tsp贪心.ilk
.......\.....\tsp贪心.pdb
.......\ipch\tsp贪心-ee5b8c9e\tsp贪心-abb76f50.ipch
.......\tsp贪心\Debug\CL.read.1.tlog
.......\.......\.....\CL.write.1.tlog
.......\.......\.....\link.read.1.tlog
.......\.......\.....\link.write.1.tlog
.......\.......\.....\mt.read.1.tlog
.......\.......\.....\mt.write.1.tlog
.......\.......\.....\tsp贪心.exe.intermediate.manifest
.......\.......\.....\tsp贪心.lastbuildstate
.......\.......\.....\tsp贪心.log
.......\.......\.....\vc100.idb
.......\.......\.....\vc100.pdb
.......\.......\.....\贪心.obj
.......\.......\tsp贪心.vcxproj
.......\.......\tsp贪心.vcxproj.filters
.......\.......\tsp贪心.vcxproj.user
.......\.......\贪心.cpp
.......\tsp贪心.sdf
.......\tsp贪心.sln
.......\tsp贪心.suo
.......\ipch\tsp贪心-ee5b8c9e
.......\tsp贪心\Debug
.......\Debug
.......\ipch
.......\tsp贪心
tsp贪心