实现手动生成一个n×m矩阵的迷宫，寻找一条从入口点到出口点的通路。迷宫有很多的分岔口，搜索整个迷宫，实际上这是对栈和回溯算法的综合操作。

要实现的主要功能：

（1）创建迷宫，将输入的迷宫数据存储到二维数组中。

（2）显示迷宫，将创建的迷宫以方阵的形式显示出来。

（3）查找路径，分别用非递归算法和递归算法查找迷宫路径。

（4）输出路径，用三元组（i,j,d）的形式输出和方阵的形式输出。

（5）.恢复迷宫，把探索过后的迷宫数据恢复。

-Manually generate a nm matrix maze to find a path from the entry point to the exit point. Maze with a lot of the fork, search the entire maze, which is actually the integrated operation of the stack and backtracking algorithm. To achieve the main functions: (1) create a maze, the input the maze data storage to a two-dimensional array. (2) shows the maze, will create the maze to the square in the form displayed. (3) Find the path, respectively, with a non-recursive algorithm and the recursive algorithm to find the maze path. (4) output path, with a triple (i, j, d) in the form of output and the form of a square of the output. (5). The recovery maze, Discover after the maze data recovery.