A collection of visualized algorithms built using Python. Each algorithm relies on NumPy for data operations and Matplotlib for rendering visuals. Visualizations animate in a Matplotlib window at a watchable pace.
Each algorithm accepts a graph defined by an adjacency-list dictionary and a collision map indicating which nodes are inaccessible.
Credit to Professor Nikolaus Correll and his Intro to Robotics course at CU Boulder for inspiring this project through its focus on path-planning algorithms in robotics.
Install the required dependencies:
pip install numpy matplotlib- BFS
- DFS
- Dijkstra's
- A_star
There is a visual rendered version and a non-visual version for each algo.
- Python 3.x
- NumPy
- Matplotlib
This project is released under the MIT License.