An Interactive Visualizer built using Python to help understand the process of path finding and maze generation algorithms. This application supports path finding alogrithms
such as Dijkstra, A* and DFS. Random DFS was used for maze generation allowing path finding algortihms to be tested under complex maps.
The application allows the user to place start and end nodes, while also having the ability to create walls on the map.
Demo (Dijkstra's Algorithm):
Demo (Random Maze with A* Algorithm):
Application Keybord Controls:
- First select start and end nodes (Left mouse click)
- Add Walls (Left mouse click after adding start and end nodes)
- Press Space-bar to run Dijkstra's algorithm
- Press A to run A* algorithm
- Press M to generate a random maze
- Press C to clear the grid
- Press D to run DFS algorithm