Tech Stack
Language and framework used in following project
This project aims to demonstrate the working of A* path finding algorithm. A* algorithm is also known as shortest path finding algorithm. This ensures that the distance from the start node to the end node is minimum irrespective of the barriers between them.
Contribute Download$terminal>> git clone https://github.com/Mayur-Debu/A-PathFinder.git
$terminal>> pip install -r requirements.txt
$terminal>> python pathFinder.py
# This are the controls of the visualization tool
'''
Red spot denotes 'start' node.
Green spot denotes 'end' node.
Black node denotes 'barrier' nodes.
Blue node denotes 'visited' nodes.
Turquoise node denoted 'open' nodes.
Mouse Control's:
Left Click: Selecting the start node, end node and the barrier's.
Right Click: Deselecting and reallocating the start, end and barrier nodes.
Keyboard Control's:
R: Generate random barrier's.
C: Clear the Grid.
SpaceBar: Start and stop the visualization.
'''
Language and framework used in following project