迷宫问题

来源：互联网发布：淘宝卖家头像怎么改编辑：程序博客网时间：2024/05/02 00:26

#include<stdio.h>
#define MAXSIZE 100
#define M 10
#define N 10
struct
{
int i; //当前方块的行号

int j;//当前方块的列号

int di;//下一个可走的方位的方位号
}st[MAXSIZE];

int top=-1; //初始化栈指针

void mgpath(int mg[10][10])
{
int i,j,di,find,k;
top++; //初始方块进栈
st[top].i=1;
st[top].j=1;
st[top].di=-1;
mg[1][1]=-1;
while(top>-1) //栈不空时循环
{
i=st[top].i;
j=st[top].j;
di=st[top].di;
if(i==M-2&&j==N-2)//找到出口
{
printf("迷宫路径如下：\n");
for(k=0;k<=top;k++)
{
printf("(%d,%d)",st[k].i,st[k].j);
if((k+1)%5==0)
printf("\n");
}
printf("\n");
}

find=0;
while(di<4&&find==0)//找下一块可走方块顺时针探索
{
di++;
switch(di)
{
case 0:i=st[top].i-1;j=st[top].j;break;
case 1:i=st[top].i; j=st[top].j+1;break;
case 2:i=st[top].i+1;j=st[top].j;break;
case 3:i=st[top].i;j=st[top].j-1;break;
}

if(mg[i][j]==0)
find=1;
}

if(find==1)//找到可走的方块
{
st[top].di=di;//修改原栈元素的di值
top++;
st[top].i=i;
st[top].j=j;
st[top].di=-1;//重置di
mg[i][j]=-1;
}
else //没有路径可走退栈
{
mg[st[top].i][st[top].j]=3;
top--;
}
}
printf("没有路径可走!\n");
}

void main()
{

int mg[10][10]=
{

{1,1,1,1,1,1,1,1,1,1},
{1,0,0,1,0,0,0,1,0,1},
{1,0,0,1,0,0,0,1,0,1},
{1,0,0,0,0,1,1,0,0,1},
{1,0,1,1,1,0,0,0,0,1},
{1,0,0,0,1,0,0,0,0,1},
{1,0,1,0,0,0,1,0,0,1},
{1,0,1,1,1,0,1,1,0,1},
{1,1,0,0,0,0,0,0,0,1},
{1,1,1,1,1,1,1,1,1,1}

};

mgpath(mg);

}