This is a simple app to find a path in a maze. It was created to show use case of Breadth First Search Algorithm and Backtracking.
The code in visualization.py is a little messy so don't try to look into it.
You can draw the walls and create the maze.
In the input field enter coordinates of start position (x_1, y_1) and destination position (x_2, y_2). Hit the ENTER.
The app will show you the shortest path from start to destination if such path exists. If no path exists the program crashes.