Program to solve the Euclidean traveling salesman problem using Greedy and A* search algorithm with two heuristics: 1) straight line distance 2) minimum spanning tree.