Implemented three algorithms with different performances that use a graph, list and disjoint set structure to solve the TSP problem for various different configurations. The data used is from the website http://www.math.uwaterloo.ca/tsp/world/countries.html. The file "podaci.pdf" contains performance comparisons of the 3 algorithms with the performance of the best tested algorithms given on the website.
-
Notifications
You must be signed in to change notification settings - Fork 0
Implemented three algorithms with different performances that use a graph, list and disjoint sets structure to solve the TSP problem for various different configurations. The data used is from the website http://www.math.uwaterloo.ca/tsp/world/countries.html.
adisabolic/traveling_salesman
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Implemented three algorithms with different performances that use a graph, list and disjoint sets structure to solve the TSP problem for various different configurations. The data used is from the website http://www.math.uwaterloo.ca/tsp/world/countries.html.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published