TravellingSalesmanOsm

TravellingSalesmanOsm

marctuscher

Travelling salesman problem on OpenStreetMap data. Shortest path distances by Dijkstra's algortihm. Frontend built with react and leaflet.

27 Stars
6 Forks
27 Watchers
C++ Language
mit License
100 SrcLog Score
Cost to Build
$2.71M
Market Value
$3.25M

Growth over time

8 data points  ·  2021-08-01 → 2026-04-01
Stars Forks Watchers
💬

How do you feel about this project?

Ask AI about TravellingSalesmanOsm

Question copied to clipboard

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.

How to clone TravellingSalesmanOsm

Clone via HTTPS

git clone https://github.com/marctuscher/TravellingSalesmanOsm.git

Clone via SSH

[email protected]:marctuscher/TravellingSalesmanOsm.git

Download ZIP

Download master.zip

Found an issue?

Report bugs or request features on the TravellingSalesmanOsm issue tracker:

Open GitHub Issues