/OpenStreetMap-Route-Planner

This repo contains my code for the Route Planning project in Course 1 of the Udacity C++ Nanodegree. I used C++ Fundamentals along with the A* Search algorithm to implement a simple little path plotting program on top of starter code provided by Udacity that handled rendering.

Primary LanguageC++OtherNOASSERTION

OpenStreetMap Route Planner

This repo contains my code for the Route Planning project in Course 1 of the Udacity C++ Nanodegree.

Cloning

When cloning this project, be sure to use the --recurse-submodules flag. Using HTTPS:

git clone https://github.com/pre-eth/OpenStreetMap-Route-Planner.git --recurse-submodules

or with SSH:

git clone https://github.com/pre-eth/OpenStreetMap-Route-Planner.git --recurse-submodules

Dependencies for Running Locally

This project was built and tested on Fedora. Building the projects requires building the IO2D library, which can be pretty difficult.

Good luck and here's what else you'll need:

Compiling and Running

Compiling and running the project is as easy as:

mkdir build && cd build
cmake ..
make
./OSM_A_star_search

Or to specify a map file:

./OSM_A_star_search -f ../<your_osm_file.osm>

Testing

The testing executable is also placed in the build directory. From within build, you can run the unit tests as follows:

./test