Contains a route planner, made in the final project of the intro course of the Udacity C++ Nanodegree. Uses OpenStreetMap data and a simple A* search implementation. As heuristic value euclidean distance is used. The project instructions can be found here
- IO2D is needed, installation instructions be found here
- Create a build directory, build here using cmake
- Run from build using the example map ../bin/Route-Planner -f ../map.osm