A Python program to implement and visualize A-star Path Finding Algorithm interactively.
A-star (also referred to as A*) is one of the most successful search algorithms to find the shortest path between nodes or graphs. It is an informed search algorithm, as it uses information about path cost and also uses heuristics to find the solution.
- Click on the blocks to place the start point/end point/walls
- Press space to start the algorithm
- Press c to clear all blocks
- press left click to remove one block
- The algorithm can run in one of two modes with Visualizer and without Visualizer
- with Visualizer mode is the one seen above in gif
- without Visualizer will find the path (blue line) without showing how it works and is almost instant
These instructions will get you a copy of the project up and running on your local machine for development and testing purposes.
Things you need to run the code
Python 3
Follow these instruction.
- Activate the virtualenv venv.
venv\Scripts\activate
- Install dependencies.
pip install -r requirements.txt
- Run application.
python main.py
- Python 3 - The Programming Language used.
- PyGame - Pygame is a cross-platform set of Python modules designed for writing video games.
Feel free to star ⭐ this repository if you like what you see 😉.