GitHub - francis802/TSP-Solver: Travelling Salesman Problem solved using Backtracking, and approximation algorithms such as: Triangular Approximation Heuristic, Closest Neighbour Heuristic and our own heuristic! Developed in C++ for the subject: "Design of Algorithms"

francis802 / TSP-Solver Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

Travelling Salesman Problem solved using Backtracking, and approximation algorithms such as: Triangular Approximation Heuristic, Closest Neighbour Heuristic and our own heuristic! Developed in C++ for the subject: "Design of Algorithms"

0 stars 2 forks Branches Tags Activity

Star

Notifications

Branches Tags

Name		Name	Last commit message	Last commit date
Latest commit History 50 Commits
code		code
documentation		documentation
.gitignore		.gitignore
CMakeLists.txt		CMakeLists.txt
Doxyfile		Doxyfile
approx_results.xlsx		approx_results.xlsx
main.cpp		main.cpp