A visualization project implementing maze generating and maze solving algorithms. Select a maze generator before selecting a solver.

Each maze is randomly generated using a selected algorithm for the maze building portion.

The BFS and DFS solvers will take random approaches to reach the target. A* and Dijkstra take heuristic approaches to find the target.

BFS: Breadth-first-search DFS: Depth-first-search