Online Tool Store
Travelling Salesman Visualizer
Plot city points, visualize route order, and compare a nearest-neighbor or brute-force result for classic traveling salesman scenarios.
This works right here on your device — nothing gets sent out.
Route comparison
Compare a nearest-neighbor route with the optimal route for up to 10 cities.
How it works
- Enter at least three city names and numeric coordinates.
- Compare the nearest-neighbor route with an exact search for the shortest closed loop.
- Use the distances as coordinate units; the tool uses straight-line distance.
FAQ
How many cities can I compare?
Enter between 3 and 10 cities. The exact search checks every ordering, so the limit keeps the calculation responsive.
Is the nearest-neighbor route always optimal?
No. It is a quick heuristic; the exact search finds the shortest closed loop for the entered points.
What do the coordinates represent?
They can be any consistent planar units. Distances use straight-line geometry and do not account for roads or travel time.
How we compare
| Feature | Online Tool Store | Manual route planning | Spreadsheet distance calculations |
|---|---|---|---|
| Shows heuristic and exact routes | Yes | Manual | Manual setup |
| Works with custom coordinates | Yes | Yes | Yes |
| Road travel times | No | No | No |
Use it to explore small, planar traveling-salesman examples; it does not model real road networks.