The following code visualizes the solving process of common pathfinding algorithms.

Choose a start and an end point, create barriers and run either A*, BFS (Breadth First Search) or Dijkstra algorithms!

A* -> BFS -> Dijkstra:

Operating instructions:

1. Choose a start (orange) and an end (turquoise) point (first and second left-clicks accordingly)
2. Create barriers (left-clicks) Right click on any block to reset it
3. Choose an algorithm to run: 'a' key - A* 'b' key - BFS 'd' key - Dijkstra
4. Reset the grid ('n' key) and start again!