#include <stdio.h>
#define M 4
#define N 4
#define MaxSize 100
int X; //標記dispapath運行次數
int mg[M+2][N+2]={
{1,1,1,1,1,1},{1,0,0,0,1,1},{1,0,1,0,0,1}
,{1,0,0,0,1,1,},{1,1,0,0,0,1},{1,1,1,1,1,1}};
struct
{
int i;
int j;
int di;
}St[MaxSize],Path[MaxSize];
int top=-1;
int count =1;
int minlen =MaxSize;
void dispapath()
{
int k;
printf("%5d:",count++);
for(k=0;k<=top;k++)
{
printf("(%d,%d)",St[k].i,St[k].j);
}
printf("\n");
if(top+1<minlen)
{
for(k=0;k<=top;k++)
Path[k]=St[k];
minlen=top+1;
}
printf("%d",X);
}
void dispminpath()
{
printf("最短路徑如下：\n");
printf("長度：%d\n",minlen);
printf("路徑：");
for(int k=0;k<minlen;k++)
{
printf("(%d,%d)",Path[k].i,Path[k].j);
}
printf("\n");
}
void mgpath(int xi,int yi,int xe,int ye)
{
int i,j,i1,j1,di;
bool find;
top++;
St[top].i=xi;
St[top].j=yi;
St[top].di=-1;mg[xi][yi]=-1;
while(top>-1)
{
i=St[top].i;j=St[top].j;
di=St[top].di;
if(i==xe&&j==ye)
{
X++;
printf("標記dispapath運行次數：%d",X);
printf("\n");
dispapath();
mg[i][j]=0;
top=top-1;
i=St[top].i;j=St[top].j;
di=St[top].di;
}
find =false;
while(di<3&&!find)
{
di++;
switch(di)
{
case 0:i1=i-1;j1=j;break;
case 1:i1=i;j1=j+1;break;
case 2:i1=i+1;j1=j;break;
case 3:i1=i;j1=j-1;break;
}
if(mg[i1][j1]==0)
find=true;
}
if(find)
{
St[top].di=di;
top++;
St[top].i=i1;St[top].j=j1;
St[top].di=-1;
mg[i1][j1]=-1;
}
else
{
mg[i1][j1]=0;
top--;
}
}
dispminpath();
}
int main()
{
printf("所有迷宮路徑如下：\n");
mgpath(1,1,M,N);
return 1;
}
轉載請註明出處，本文鏈接：https://www.uj5u.com/houduan/47576.html
標籤：基礎類
上一篇：c++ builder 6創建的專案中如何添加dump檔案？
下一篇：類之間怎么進行資料呼叫