bhargav-modha/TravellingSalesmanProblem

Travelling Salesman Problem is based on a real-life scenario, where a salesman from a company must start from his own city and visit all the assigned cities exactly once and return to his home till end of the day. The exact problem statement goes like this, "Given a set of cities and distance between every pair of cities, the problem is to find the shortest possible route that visits every city exactly once and returns to the starting point."

C++