mig.rar_迷宫问题

#include "stdio.h" #define m 12 #define n 15 static struct {int x; int y; int v; int top; } stack[500]; int maze[m+2][n+2]={1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1, 1,0,1,0,0,0,1,1,0,0,0,1,1,1,1,1,1, 1,1,0,0,0,1,1,0,1,1,1,0,0,1,1,1,1, 1,0,1,1,0,0,0,0,1,1,1,1,0,0,1,1,1, 1,1,1,0,1,1,1,1,0,1,1,0,1,1,0,0,1, 1,1,1,0,1,1,1,1,0,1,1,0,1,1,0,0,1, 1,1,1,0,1,0,0,1,0,1,1,1,1,1,1,1,1, 1,0,0,1,1,0,1,1,1,0,1,0,0,1,1,1,1, 1,0,1,1,1,1,0,0,1,1,1,1,1,1,1,1,1, 1,0,0,1,1,0,1,1,0,1,1,1,1,1,0,1,1, 1,1,1,0,0,0,1,1,0,1,1,0,0,0,0,0,1, 1,0,0,1,1,1,1,1,0,0,0,1,1,1,1,0,1, 1,0,1,0,0,1,1,1,1,1,0,1,1,1,1,0,1, 1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}; int move[8][2]={0,1,1,1,1,0,1,-1,0,-1,-1,-1,-1,0,-1,1}; void findpath() {void print(); int g,h,i,j,v,t,flag,top; static int mark[m+2][n+2]; i=1;j=1;top=0; do { for(v=0,flag=0;v<8&&flag==0;v++) {g=i+move[v][0]; h=j+move[v][1]; if ((maze[g][h]==0)&&(mark[g][h]==0)) {mark[g][h]=1;flag=1; top++; stack[top].x=i; stack[top].y=j; stack[top].v=v; i=g; j=h; } } if(flag==0) {if(top==0) break; else {i=stack[top].x; j=stack[top].y; top--; } } } while (i!=m||j!=n&&top!=0); if(top==0) printf("NO PATH OUT\n"); else { printf("\nentrance:"); for(t=1;t<=top;t++) {maze[stack[t].x][stack[t].y]=8; printf("(%d,%d) ",stack[t].x,stack[t].y); switch(stack[t].v) {case 0:printf("E->");break; case 1:printf("SE->");break; case 2:printf("S->");break; case 3:printf("SW->");break; case 4:printf("W->");break; case 5:printf("NW->");break; case 6:printf("N->");break; default:printf("NE->"); } } printf("exit\n"); for(i=1;i<=m;i++) for(j=1;j<=n;j++) {printf("%d ",maze[i][j]); if(j==n) printf("\n\n"); } } } main() {void findpath(); int i,j; findpath (); }