Memory efficient data structures & algorithms on (geo) graphs
This software stands under Apache License 2
Download OSM file (40MB compressed, then 450MB uncompressed), build graph hopper and run it:
cd core; ./run.sh unterfranken
the resulting GraphHopper file will be around 30MB
- when executing the command again, then the OSM won't be parsed again, so the UI should pop up fast within 2 seconds.
- After the UI popped up you can drag to move the map or scroll to zoom like in ordinary maps apps
- Click once to select a departure and another click to select the destination
- You want to get an impression of how bidirectional Dijkstra is working? Click this image
- Then a route should pop up like in this SHINY ;) image
If you want to import a bigger OSM (Germany) then run:
cd core; ./run.sh germany
- For Germany it takes approx 25 minutes for the import and roughly 1 minute for the ugly&slow UI to pop up. Probably you'll need to tune the memory settings - send me a mail if this fails!
- At the moment the UI is a bit rough and simple so, don't click or drag too much ;)