We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
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).
There was an error while loading. Please reload this page.