Introduction - If you have any usage issues, please Google them yourself
A path to solve the maze procedure. In an M* N' s long square maze, 0 and 1, respectively maze of paths and obstacles. For any set of the maze, find a path from the inlet to the outlet, or not come to the conclusion path. Linked list structure for storing a stack type non-recursive procedure.