Path Finding Visualizer

Visualize path finding algorithms in a customizable grid using pygame

Implemented algorithms

• DFS: doesn't find shortest path
• BFS: finds shortest path
• A*: finds shortest path using diagonal distance heuristic

How to use

• Clicking any grid cell creates an obstacle.
• Place starting point by clicking the start button and then selecting a grid cell or directly hover over a cell and press 'S' key. Same for path end, pressing 'E'.
• Clear the grid by presing 'C' or the button.
• Start path finding algorithms by pressing the corresponding button. Pause the animation at any time by pressing 'space', skip the animation by pressing 'enter' or change its speed using the 'slow'/'normal'/'fast' options.
• In the options pop-up you can change the grid dimensions. You can also configure the algorithms to use diagonals as admissible paths.