Double click the green flag to ensure it properly resets, as this project uses clones and has been acting up. This simulator takes in a map that you create, and finds the shortest path that connects every point to every other. It is a version of the traveling salesman problem, however, due to the constraints on the number of edges and the fact that you do not have to make a hamiltonian path, or end where you started, it can be solved in polynomial time (I believe).
Thanks to my CS teacher for giving us the original problem that led to me making this simulator.
