tsp_solve
Computes a short round-trip route visiting every given city and returning to the starting point using a nearest-neighbor heuristic.
Instructions
Find a short tour visiting all cities and returning to start (traveling salesman, nearest-neighbor heuristic).
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| cities | Yes | Array of {name, x, y} city locations |