A tool for Visualizing Various path Finding algorithms Built using plane Javascript

• Dijkstra
• A*
• Depth-First-Search (DFS)
• Bredth-First-Search (BFS)

Built VanillaJS pathfinding visualizer using bunch of different shortest-path algorithms (Dijkstra, A*, DFS, BFS) and Generate the grid using maze-generation algorithm (recursive backtracking) and the ability of controlling the grid structure and the distribution of the blocks along with the speed of the visualization (delay papameter) and the size of the grid

1. Users can drag around the start and end node to set them in any spot.
2. Users can then choose a speed of the visualization (delay)(By default delay = 10ms between easch visualisation step).
3. User can generate a maze by drawing on the grid or by using maze generation Algorithms like recursive backtracking(prims algorithm) and DFS
4. Users can optionally choose to clear the maze or draw walls by clicking and dragging the mouse.
5. Users can optionally randomize the walls in the maze and add more walls by dragging the mouse.