Building an OpenStreetMap Route Planner Project

Overview

Introdution

In this project I have developed the OpenStreetMap data and an IO2D map display code and also involves the extension of the IO2D map display code to use the A* algorithm using C++. The program will be able to find the shortest path between two points on the map. On running the program, you will be able to select the starting and ending areas on a city map, and this program will find the shortest path along the city streets to connect the start and end.

Cloning

To clone the project:

 git clone https://github.com/SreeramVipparla/CppND-Route-Planning-Project.git

Dependencies for Running Locally

• cmake >= 3.11.3
  • All OSes: click here for installation instructions
• make >= 4.1 (Linux, Mac), 3.81 (Windows)
  • Linux: make is installed by default on most Linux distros
  • Mac: install Xcode command line tools to get make
  • Windows: Click here for installation instructions
• gcc/g++ >= 7.4.0
  • Linux: gcc / g++ is installed by default on most Linux distros
  • Mac: same instructions as make - install Xcode command line tools
  • Windows: recommend using MinGW
• IO2D
  • Installation instructions for all operating systems can be found here
  • This library must be built in a place where CMake find_package will be able to find it

Compiling

To compile the project, first, create a build directory and change to that directory:

mkdir build && cd build

From within the build directory, then run cmake and make as follows:

cmake ..
make

Running

The executable will be placed in the build directory. From within build, the project can be run as follows:

./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. To run the test,run the command :

./test