Travelling salesman problem on OpenStreetMap data. Shortest path distances by Dijkstra's algortihm. Frontend built with react and leaflet.
What is the marctuscher/TravellingSalesmanOsm GitHub project? Description: "Travelling salesman problem on OpenStreetMap data. Shortest path distances by Dijkstra's algortihm. Frontend built with react and leaflet.". Written in C++. Explain what it does, its main use cases, key features, and who would benefit from using it.
Question is copied to clipboard — paste it after the AI opens.
Add it to a GitHub README or profile — the card updates as the ranking changes:
Clone via HTTPS
Clone via SSH
Download ZIP
Download master.zipReport bugs or request features on the TravellingSalesmanOsm issue tracker:
Open GitHub Issues