This project implements the Depth First Search and a Breadth First Search algorithms to solve a maze parsed fron a .txt file.
It's part of a Harvard IA course that I'm taking, with the goal of applying the knowledge in graph theory to solve IA problems.