迷宫算法求解

/* ****************迷宫算法求解***************** */ /* bc++3.1和vc++6.0下调试通过* */
/*********设计目标：教学演示**********************/ #include<stdio.h>
#include<conio.h>
#include "stdlib.h"
#define NULL 0
#define rows 10
#define cols 10
typedef struct
{int row;
int col;
}PosType; //坐标点结构
typedef struct
{int ord;//通道块在路径上的"序号"
PosType seat;//通道块在迷宫中的"坐标位置"
int di;//从此通道快走向下一通道块的"方向"
}SElemType;//栈的元素类型
typedef struct
{SElemType *base;
SElemType *top;
int stacksize;
}SqStack;//堆栈结构
int InitStack(SqStack &s)//初始化堆栈
{
s.base=(SElemType *)malloc(100*sizeof(SElemType));
if(!s.base) return 0;
s.top=s.base;
s.stacksize=100;
return 1;
}
int StackEmpty(SqStack s) //栈空判别
{return(s.top==s.base);
}
int Pop(SqStack &s,SElemType &e)//弹栈
{if(s.top==s.base)return 0;
e=*--s.top;
return 1;
}
int Push(SqStack &s,SElemType e)//将元素压入堆栈
{if(s.top-s.base>=s.stacksize)
{s.base=(SElemType *)realloc(s.base,(s.stacksize+10)*sizeof(SElemType)); if(!s.base)exit(-2);
s.top=s.base+s.stacksize;
s.stacksize+=10;
}
*s.top++=e;
return 1;
}
static int maze[rows][cols]=
{{0,0,0,0,0,0,0,0,0,0},
{0,1,1,0,1,1,1,0,1,0},
{0,1,1,0,1,0,1,0,1,0},
{0,1,1,0,1,0,0,1,1,0},
{0,1,1,0,0,1,1,1,1,0},
{0,1,1,1,0,1,1,1,1,0},
{0,1,0,1,1,1,0,1,1,0},
{0,1,0,0,0,1,0,0,1,0},
{0,0,1,1,1,1,1,1,1,0},
{0,0,0,0,0,0,0,0,0,0},
};
//初始迷宫数据（1－通，0－不通）
static int foot[10][10]={0};//标记某点是否走过（1－走过，0－未走过）
void printpath(SqStack &s)//打印迷宫通路
{int i,j;
SElemType e;
while(!StackEmpty(s))
{Pop(s,e);
foot[e.seat.row][e.seat.col]=1;
}
for(i=0;i<10;i++)
{printf("\n");
for(j=0;j<10;j++)
if(foot[i][j]) printf(" # ");
else printf(" 。

");
}
}
int Pass(PosType pos)//判断当前的通道块是否可通
{
return(maze[pos.row][pos.col]);
};
void FootPrint(PosType pos)
{
maze[pos.row][pos.col]=0;
}
PosType NextPos(PosType curpos,int dir)//取当前通道块的下一个通道块{ switch(dir)
{case 1:
curpos.row++;
break;
case 2:
curpos.col++;
break;
case 3:
curpos.row--;
break;
case 4:
curpos.col--;
}
return curpos;//将下一个通道块变为当前通道块
}
int END(PosType curpos,PosType end)
{return(curpos.row==end.row && curpos.col==end.col);
}
int MazePath(SqStack &s,PosType start,PosType end)
{PosType curpos;//,nextpos;
int curstep;
SElemType e;
InitStack(s);
curpos=start;
curstep=1;
do{
if(Pass(curpos))
{FootPrint(curpos);
e.ord=curstep;e.seat=curpos;e.di=1;
Push(s,e);
if(END(curpos,end)) return 1;
curpos=NextPos(curpos,1);
curstep++;
}/* end of if */
else
{ if(!StackEmpty(s))
{ Pop(s,e);
while(e.di==4 && !StackEmpty(s))
{FootPrint(e.seat);/* The same fuction as MarkPrint ? */ Pop(s,e);
}/* end of while */
if(e.di<4)
{e.di++;Push(s,e);
curpos=NextPos(e.seat,e.di);
} /* end of if */
} /* end of if */
} /* end of else */
}while(!StackEmpty(s));
curstep=0;
return 0;
}
void main()
{SqStack s;
static PosType start={1,1},end={8,8};
MazePath(s,start,end);
if(!StackEmpty(s))
printpath(s);
else
printf("\n NO find the path!");
}。