Introduction - If you have any usage issues, please Google them yourself
The implementation of the code is a simple maze. A m* n the long square maze, 0 and 1, respectively pathways and obstacles in the maze. Design a program, any set of maze, find a path from the entrance to the exit, excluded conclusions drawn not go the same way. Basic requirements: First a linked list storage structure stack type, and then write a non-recursive program to solve the maze, the obtained path triples (i, j, d) in the form of output, of which: (i i) directing the maze of a coordinate, d go to the next coordinate direction.