A naive solution to the Traveling Salesman problem using Prim's Algorithm to find a Euclidean minimum spanning tree.