A maze solver using depth first search. I borrowed an algorithm for finding the shortest paths between nodes in a graph (A* -> Dijkstra's algorithm).