LA Mathematical Algorithm - BSPIEGEL

See inside

The program will prompt the user for how many nodes they'd like to run the nearest-neighbor TSP algorithm on.

Notes and Credits

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.

Shared: 19 Jan 2017 Modified: 22 Jan 2017
Favorite this project 3
Love this project 3
Total views 117
View the remix tree  1
More projects by PapaJ0hn