Maze PathFinder Visualizer implemented in Python

How to use

Download:

git clone https://github.com/ss892714028/Maze-PathFinder-Visualization-Python

Install required Libraries

pip install -r requirements.txt

Settings

Go to config.py and change settings.

• 'w': width of the board
• 'h': height of the board
• 'algo':'bfs' for Breadth first search
• 'algo':'dfs' for Depth first search
• 'algo':'astar' for A*

Run the visualization

python ./src/drawer.py

• The first two left clicks on the board initialize start and end node
• Click or click and drag to create obstacles
• Press space bar and see the algorithm takes off!

Symbols

• "@": Start and end node
• "#": Obstacles
• "*": Visited node
• "+": Path

Contributions

All contributions are welcome. :)

Algorithm Implemented

• BFS
• DFS
• ASTAR (A*)

Breadth First Search

Breadth First Search is unweighted and guarantee a optimal path.

Depth First Search

Depth First Search is unweighted and does not guarantee a optimal path.

Astar (A*)

A* is weighted and guarantee a optimal path.