c语言数据结构程序设计迷宫总结,数据结构用c语言写的迷宫问题

该楼层疑似违规已被系统折叠 隐藏此楼查看此楼

MStackElem start,end,cur;

start.x = 0;

start.y = 0;

start.val = *(maze+start.x*n+start.y);

end.x = 7;

end.y = 7;

end.val = *(maze+end.x*n+end.y);

cur = start;

printf("%d",cur.x);

printf("%d",cur.y);

printf("%d",cur.val);

do

{

if (unPass(path,cur)) {

push(&realPath,cur);

push(&path,cur);

cur = getNext(cur,*maze,n);

if (cur.x == end.x && cur.y == end.y) {

push(&realPath,cur);

push(&path,cur);

return true;

}

else if(cur.val == -1) {

pop(&realPath);

cur = getTop(&realPath);

}

}

else {

cur = getNext(cur,*maze,n);

if (cur.val == -1) {

pop(&realPath);

cur = getTop(&realPath);

}

}

} while (cur.x != end.x || cur.y != end.y);

}

void printMazePath(MStack *s) { MStackElem e;

while (s->top != s->base) {

MStackElem e = *(s->top-1);

printf("maze[%d][%d]----->",e.x,e.y);

(s->top)--;

}

while (s->base < (s->top-1)) {

e = *(s->base);

printf("maze[%d][%d]----->",e.x,e.y);

(s->base)++;

}

e = *(s->base);

printf("maze[%d][%d]",e.x,e.y);

}

main(){ int *maze;

int n,m;

int i,j;

printf("input n\n");

scanf("%d",&n);

printf("input m\n");

scanf("%d",&m);

maze=(int *)malloc(sizeof(int)*m*n);

srand(time(NULL));

for(i=0;i

{

for(j=0;j

{

*(maze+j+n*i)=rand()%2;

printf("%d ",*(maze+j+n*i));

}

printf("\n");

}

getch();

initStack(&realPath);

initStack(&path);

getMazePath(*maze,n);

printf("The path of through the maze is:\n\n");

printMazePath(&realPath);

getch();

}