TravellingSalesmanOsm
TravellingSalesmanOsm copied to clipboard
Travelling salesman problem on OpenStreetMap data. Shortest path distances by Dijkstra's algortihm. Frontend built with react and leaflet.
Results
3
TravellingSalesmanOsm issues
Sort by
recently updated
recently updated
newest added
Is there any (easy) way to solve TSP on other categories of paths than roads? For example foot paths?
make rm -f main.out g++ -std=c++11 -Wall -g -march=native -O3 -I ./include/ -I ../osmpbf/osmpbf/include -I ../osmpbf -I ./ -I ../Simple-Web-Server/ -L ./../osmpbf/build/osmpbf/ edge.cpp node.cpp graph.cpp graphreader.cpp search.cpp dynprog.cpp webserver.cpp main.cpp...