数据结构老鼠迷宫VC源程序.doc

#include#include#include#define for if(0);else for#define max 300char mapmaxmax;int cross,vertical;/老鼠的横纵坐标int time;typedef struct int x,y;int step;point;point s;point queue100*max;int amaxmax;int dx4=0,1,0,-1;int dy4=1,0,-1,0;int value_place(point tmp, int i, int row, int col) if(tmp.x+dxi=0 & tmp.x+dxi=0 & tmp.y+dyicol & maptmp.x+dxitmp.y+dyi!=*& atmp.x+dxitmp.y+dyi=0)return 1; return 0;int Bfs(point start, int row, int col) int i,front=0,tail=1; point tmp; tmp =start; queue0 = tmp;queue0.step = 0; while(front != tail) for(i=0; i4; i+) if(value_place(tmp, i, row, col) if(maptmp.x+dxitmp.y+dyi=C) return queuefront.step+1; queuetail.x = tmp.x+dxi; queuetail.y = tmp.y+dyi;atmp.x+dxitmp.y+dyi=1;queuetail.step = queuefront.step+1; tail+; tmp = queue+front; return -1;void display(int n,int m)printf(迷宫地图:n);for(int i=0;in;i+)for(int j=0;jm;j+)printf( );printf(%c,mapij);printf(n);return ; int scan(int n,int m,char ch)int i,j,z=0,ans;switch(ch)case 1: printf(对迷宫进行编辑操作!请输入要改变的墙或路的坐标：n); scanf(%d%d,&i,&j); if(mapij=C|mapij=L|i=n|j=m) printf(输入迷宫坐标非法!n); else if(mapij=.) mapij=*; else mapij=.; display(n,m);memset(a,0,sizeof(a); ans = Bfs(s, n, m); printf(最短路径为:%dn,ans); break;case 2: printf(输入想重置的限定时间:n); scanf(%d,&time); printf(the new set limit time:%dn,time); break;case a:if(mapcrossvertical-1=.&vertical-1=0)mapcrossvertical-1=L;mapcrossvertical=.;display(n,m);vertical-;s.y-;z=1;else if(mapcrossvertical-1=C&vertical-1=0) printf(老鼠在规定的时间内成功地到达!n);z=2;break;case d:if(mapcrossvertical+1=.&vertical+1m) mapcrossvertical+1=L;mapcrossvertical=.;display(n,m);vertical+;s.y+;z=1;else if(mapcrossvertical+1=C&vertical+1=0) mapcross-1vertical=L;mapcrossvertical=.;display(n,m);cross-;s.x-;z=1;else if(mapcross-1vertical=C&cross-1=0)printf(老鼠在规定的时间内成功地到达!n);z=2;break;case s:if(mapcross+1vertical=.&cross+1m) mapcross+1vertical=L;mapcrossvertical=.;display(n,m);cross+;s.x+;z=1;else if(mapcross+1vertical=C&cross+1m)printf(老鼠在规定的时间内成功地到达!n);z=2;break;return z ;int main()int n,m,z=0;char ch;/freopen(1.txt,r,stdin);printf(输入迷宫地图的长宽:n);scanf(%d%d,&n,&m);getchar();printf(输入迷宫地图:n);for(int i=0;in;i+)gets(mapi); display(n,m);int floge=0;for(int i=0;in;i+)for(int j=0;jm;j+)if(mapij=L)cross=i;vertical=j;floge=1;s.x = i;s.y = j;break;if(floge=1)break; int ans = Bfs(s, n, m); printf(最短路径为:%dn,ans);floge=0;printf(输入规定的时间:n);scanf(%d,&time); printf(limit time:%dn,time);printf(*n); printf(*1.按键w用以控制老鼠的上移操作!*n);printf(*2.按键s用以控制老鼠的下移操作!*n);printf(*3.按键a用以控制老鼠的左移操作!*n); printf(*4.按键d用以控制老鼠的右移操作!*n);printf(*5.按键1用以修改迷宫地图的操作!*n);printf(*5.按键2用以修改限定时间的操作!*n);printf(*n);while(ztime)ch=get