An implementation of the A* algorithm to determine the shortest path between two nodes in a graph.
Set-up a virtual environment and activate it:
python3 -m venv env
source env/bin/activate
You should see (env) before your command prompt now. (You can type deactivate
to exit the virtual environment any time.)
Install the requirements:
pip install -U pip
pip install -r requirements.txt
Make sure you are in the virtual environment (you should see (env) before your command prompt). If not source /env/bin/activate
to enter it.
Usage: shortest_path.py
Udacity's Data Structures and Algorithms Nanodegree Program
Route Planner is licensed under the MIT license.