A C++ implementation of algorithms to solve the Traveling Salesman Problem (TSP) using Backtracking Search and Triangular Approximation Heuristic, developed for the Algorithm Design course at FEUP.
algorithmscppdata-structuresgraph-theorybacktracking-algorithmprims-algorithmalgorithm-designtravelling-salesman-problemtriangular-approximation
-
Updated
Nov 26, 2025 - C++