-1) printf(“此迷宫无通路\n”) elem.x=x;elem.y=y;elem.dir=dir;/*最后出口的坐标入栈*/ printf(“迷宫通路是:Ⅶn”); /*显示迷宫通道*/ while (i<=s->top) i printf("%d, %d",s->stack[i]. x, s->stack[i]y printf(“->”); prI 1 /*path*/ /*在迷宫中绘制出通路*/ void draw(int maze [][N2], sqstktp *s for(i=1;i<=M;i++)/*将迷宫中全部的-1值恢复为0值*/ maze [i][j]=0; /*根据栈中元素的坐标,将通路的各个点的值改为8*/ elem=pop(s) i=elem. x: j=elem maze [i][j]=8 for(i=l: it=M: i++) printf(“%3d”,maze[i][j]);/*显示已标记通路的迷宫* prlif (s->top= =-1) printf(“此迷宫无通路\n”); else { elem.x=x;elem.y=y;elem.dir=dir; /*最后出口的坐标入栈*/ f=push(s,elem); printf(“迷宫通路是：\n”); i=0; /*显示迷宫通道*/ while (i<=s->top) { printf(“%d,%d”,s->stack[i].x,s->stack[i].y; if(i!=s->top) printf(“-->”); if((i+1)%4= =0) printf(“\n”); i++; } printf(“\n”); } } /*path*/ /*在迷宫中绘制出通路*/ void draw(int maze[][N2],sqstktp *s) { int i,j; elemtype elem; for(i=1;i<=M;i++) /*将迷宫中全部的-1 值恢复为 0 值*/ for(j=1;j<=N;j++) if (maze[i][j]= =-1) maze [i][j]=0; /*根据栈中元素的坐标，将通路的各个点的值改为 8*/ while (s->top>-1) { elem=pop(s); i=elem.x;j=elem.y; maze[i][j]=8; } for(i=1;it=M;i++) { for(j=1;j<=N;j++) printf(“%3d”,maze[i][j]); /*显示已标记通路的迷宫*/ printf(“\n”); }