TheTravelingSalesmanProblem

CS 325 Final Project: TSP

Final project for CS325 Algorithms class at OSU.
As a group of 3, we investigated The Traveling Salesman Problem through the lens of 3 techniques.
We looked at: Dynamic Programming, Nearest Neighbor, and Christofides' Algorithm.
We chose to implement Nearest Neighbor because of runtime limitations, and our results are shown in "Algorithms Final Report-1.pdf"

Name		Name	Last commit message	Last commit date
Latest commit History 19 Commits
Algorithms Final Report-1.pdf		Algorithms Final Report-1.pdf
FinalProject.zip		FinalProject.zip
README.md		README.md
TSP.cpp		TSP.cpp
TSPAllVisited.py		TSPAllVisited.py
TSPAllVisited.pyc		TSPAllVisited.pyc
almostThere.cpp		almostThere.cpp
closer.cpp		closer.cpp
idkMaybe.cpp		idkMaybe.cpp
nnTSP.cpp		nnTSP.cpp
nnTSPtime.cpp		nnTSPtime.cpp
noFault.cpp		noFault.cpp
test-input-1.txt		test-input-1.txt
test-input-2.txt		test-input-2.txt
test-input-3.txt		test-input-3.txt
test-input-4.txt		test-input-4.txt
test-input-5.txt		test-input-5.txt
test-input-6.txt		test-input-6.txt
test-input-7.txt		test-input-7.txt
tsp		tsp
tsp-verifier.py		tsp-verifier.py
tsp.cpp		tsp.cpp
tsp_example_1.txt		tsp_example_1.txt
tsp_example_1.txt.tour		tsp_example_1.txt.tour
tsp_example_2.txt		tsp_example_2.txt
tsp_example_2.txt.tour		tsp_example_2.txt.tour
tsp_example_3.txt		tsp_example_3.txt
tsp_example_3.txt.tour		tsp_example_3.txt.tour
tsp_testing.cpp		tsp_testing.cpp
watch.py		watch.py

Provide feedback