Welcome to my pathfinding visualizer. I built this application to better understand how pathfinding algorithms work and to see them in action !
To check it out, here's the link: Pathfinding Visualizer
- Setting of walls/obstacles to better visualize the pathfinding algorithm
- Start / End node / walls are removable
- Toggle allowance of diagonal traversals for A* Search
- Toggle algorithm to use - A* or Dijkstra
- Set grid size
- Reset grid
Dijkstra's Algorithm: One of the first shortest path first(SPF) algorithm which guarantees the shortest path
A* Search(without diagonals): A modified version of Dijkstra's Algorithm, it uses heuristics(Manhattan) to guarantee the shortest path much faster than Dijkstra's Algorithm
A* Search(with diagonals): Same as above but much faster as it allows diagonal traversals. Uses Euclidean heuristics to guarantee a shorter path.
Tech stacks used: ReactJS, Javascript, CSS