Traveling Salesman Problem

This is a program I wrote to solve the traveling salesman problem. Given an input file named input.txt with the number of points to be calculated and a numbered list of two-dimensional points, my program will calculate the shortest path between them. If the program is not able to calculate the best path before the user-appointed time limit runs out, it will return its best guess at the shortest path.

How to run:

  1. On a computer with g++ installed, download the linked .zip file.

  2. Extract the .zip file and open a terminal window in the resulting folder.

  3. Type "make".

  4. Type "./TravelingSalesmanProblem input.txt <seconds>", with <seconds> denoting the desired time limit for program runtime.