for(i=0,j=0;i<=<M+1;i+)//设置迷宫的边界 maze li]lj]=l [i][j]=1 (i=0,j=0;j<=N+1;j++) maze [i][j]=1 for(i=M+1,j=0;j<=N+1;) maze i]lil=l /*初始化方向位移数组* void inmove (struct moved move /*依次为E,SE,S,SW,W,NW,N,NE* move[1]. dx=1; move[1] dy=l move [2]. dx=l; move [2] dy=0 move[3]. dx=: move[3] dy=-1 move[4]. dx=0 move [4] dy=-1 move [5]. dx-1: move [5] dy=-1 move [6]. dx=-1; move [6]. dy=0 move[7].dx=-1: move [7] dy=l 1/*inimove*/ /*初始化栈*/ void inistack(sqstktp *s) /*数据元素x入指针s所指的栈* if(s->top== MAXLEN-1)/*栈满,返回 False*/ s-> stack[艹+s-top]=x;/*栈不满,执行入栈操作*/ return(Ture): 1 /*栈顶元素出栈*/ elemtype pop (sgstktp *s elemtype ele if(s->top<0)/*如果栈空,返回空值*/printf(“\n”); for(i=0,j=0;i<=<M+1;i++)//设置迷宫的边界 maze[i][j]=1; for(i=0,j=N+1;i<=M;i++) maze[i][j]=1; for(i=0,j=0;j<=N+1;j++) maze[i][j]=1; for(i=M+1,j=0;j<=N+1;) maze[i][j]=1; } /*初始化方向位移数组*/ void inmove(struct moved move[]) /*依次为 E,SE,S,SW,W,NW,N,NE*/ { move[0].dx=0;move[0].dy=1; move[1].dx=1;move[1].dy=1; move[2].dx=1;move[2].dy=0; move[3].dx=1;move[3].dy=-1; move[4].dx=0;move[4].dy=-1; move[5].dx=-1;move[5].dy=-1; move[6].dx=-1;move[6].dy=0; move[7].dx=-1;move[7].dy=1; } /*inimove*/ /*初始化栈*/ void inistack(sqstktp *s) { s->top=-1; }/*inistack*/ /*数据元素 x 入指针 s 所指的栈*/ int push(sqstktp *s,elemtype x) { if (s->top= =MAXLEN-1) /*栈满，返回 False */ return(False); else { s->stack[++s->top]=x; /*栈不满，执行入栈操作*/ return(Ture); } } /*push*/ /*栈顶元素出栈*/ elemtype pop(sqstktp *s) { elemtype elem; if (s->top<0) /*如果栈空，返回空值*/