Traveling Salesperson Problem & Prim's Algorithm

An algorithms-focused program that takes in a series of coordinates and, depending on the option selected, returns either a minimum spanning tree or a solution to the traveling salesperson problem, with the option of using either a faster method to reach the solution, or a slower but more optimal method.