LA Mathematical Algorithm - BSPIEGEL
The program will prompt the user for how many nodes they'd like to run the nearest-neighbor TSP algorithm on.
Nodes are randomly places and invisible tacos cover all bases so that a complete graph is drawn. Coordinates of the vertices are kept in a list which is used when running the nearest-neighbor algorithm. Euclidean distance is used as the F score; the greedy algorithm will move to the nearest unvisited node by testing each unvisited node.