This program generates a random maze of any given size.
It uses Depth-First Search for building paths in the maze.
After generating the maze, the program finds the shortest path from the start cell to the end cell using Breadth-First Search.
1. Generating the maze using DFS
2. The BFS
3. Displaying the shortest path from start to end
Controls:
- Esc for closing the application