Skip to content

A Route Planner based on A* search algorithm implemented in C++ to find the best route in a given OpenStreetMap

Notifications You must be signed in to change notification settings

diegoavillegasg/a-star-route-planner

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

4 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Route Planning Project

This repo contains the code a Route Planning project that implements the A* search algorithm in C++.

Cloning

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

git clone https://github.com/diegoavillegasg/a-star-route-planner.git --recurse-submodules

or with SSH:

git clone git@github.com:diegoavillegasg/a-star-route-planner.git --recurse-submodules

Dependencies for Running Locally

Compiling and Running

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, you can run the project 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. From within build, you can run the unit tests as follows:

./test

About

A Route Planner based on A* search algorithm implemented in C++ to find the best route in a given OpenStreetMap

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published