Traveling Salesman Problem Visualizer
Click on the canvas to add cities. Use the algorithms below to find the shortest tour.
Number of Random Cities:
15
Animation Speed:
50
Actions:
Generate Random Cities
Clear All
Algorithms:
Nearest Neighbor
2-Opt Improvement
Nearest + 2-Opt
Compare All Algorithms
Cities
0
Current Distance
-
Algorithm
None
Status
Ready
Algorithm Comparison Results