Algorithm Visualization.
Breadth first Search (unweighted Dijkstra) https://en.wikipedia.org/wiki/Breadth...
The algorithm goes around the neighbors and until it reaches the end node.
BFS guarantees an optimal path!!
How I implemented this in less than 100 lines in Python with pygame: https://github.com/ss892714028/Maze-P...
More Path finding algorithms Implemented in Python including DFS, A* etc.: https://github.com/ss892714028/Maze-P...