Description: Problem Description: a m * n rectangle represents the maze, and 0 and 1 indicate maze paths and obstacles, respectively. Design a program, for any set of mazes, to find a passage from the entrance to the exit, or draw no access to the conclusions.
Basic requirements: first of all, to achieve a list of storage structures for the stack type, and then write a solution to the maze of non recursive procedures. The resulting path is output in the form of three tuples (I, J, d), where: (I, J) indicates a coordinate in the maze, and D indicates the direction to the next coordinate.
To Search:
File list (Check if you may need any files):
迷宫求解非递归.cpp
迷宫求解递归.cpp
Download