Title:
Traveling-salesman-problem Download
Description: we re storing the cost form city to city in a 2-dimentional array, the algorithm first solves the problem for the shortest way with a shortest cost,
then we solve it with the gready algorithm just to compare the results.
To Search:
File list (Check if you may need any files):
Traveling salesman problem\Debug\ThirdQuestion.exe
..........................\.....\ThirdQuestion.ilk
..........................\.....\ThirdQuestion.pdb
..........................\ThirdQuestion\Debug\Source.obj
..........................\.............\.....\ThirdQuestion.log
..........................\.............\.....\..............tlog\CL.read.1.tlog
..........................\.............\.....\..................\CL.write.1.tlog
..........................\.............\.....\..................\link.read.1.tlog
..........................\.............\.....\..................\link.write.1.tlog
..........................\.............\.....\..................\ThirdQuestion.lastbuildstate
..........................\.............\.....\vc120.idb
..........................\.............\.....\vc120.pdb
..........................\.............\Source.cpp
..........................\.............\ThirdQuestion.vcxproj
..........................\.............\ThirdQuestion.vcxproj.filters
..........................\ThirdQuestion.sdf
..........................\ThirdQuestion.sln
..........................\ThirdQuestion.v12.suo
..........................\.............\Debug\ThirdQuestion.tlog
..........................\.............\Debug
..........................\Debug
..........................\ThirdQuestion
Traveling salesman problem