A simple terminal-based maze generator and solver built with Python. The project uses DFS recursive backtracking to generate solvable mazes, DFS to find the solution path, and unit tests to support ...

// Creates an adjacency list to represent the graph. // Uses recursion to perform Depth First Search. // Marks visited vertices to prevent repeated traversal. // Visits each connected vertex ...