.迷宫是一个m行n列的矩阵，其中0表示无障碍，1表示有障碍。设入口为（1，1），出口为（m,n），即从入口出发，顺某一方向向前探索，若能走通，则继续往前走；否则沿原路退回，换一个方向再继续探索，直到出口为止。

2.迷宫的功能

要求随机生成一个m行n列的矩阵，为了操作方便可以在矩阵外围生成一圏障碍，设置东南西北四个方向，采用链栈进行操作。最后迷宫如不是通路给出“此迷宫元解”，如是通路要求输出所走过的路径。

3．结点结构类型描述如下

typedef struct node

{ int row

int col

struct node *next

}

-The maze is an m-by-n matrix, where 0 indicated that accessibility, 1 indicates that there is an obstacle. Let entrance (1,1), export (m, n), from the entry, along a direction forward discover, if we go through, then continue to move forward　otherwise returned along the same route, from a different direction continue to explore until export. 2 the functional requirements of the maze randomly generates a matrix of m rows n columns, Juan obstacles for convenience of operation can be generated in the periphery of the matrix, set the direction of the four cardinal points, chain stack operation. The last maze if not given path " maze element solution, if path requires the path traversed by the output. 3. The node structure type descr iption as follows typedef struct node {int row　int col　struct node* next }