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 twodimensional points, my program will calculate the shortest path between them. If the program is not able to calculate the best path before the userappointed time limit runs out, it will return its best guess at the shortest path.
How to run:

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

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

Type "make".

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