资源描述：
《数据结构迷宫问题 C C++随机迷宫 堆栈遍历》由会员上传分享，免费在线阅读，更多相关内容在教育资源-天天文库。
1、“数据结构”迷宫问题VS2008VC6.0调试通过。随机生成一个迷宫，用堆栈方式实现迷宫遍历，非软件人，算法和结构海涵。//====================================================#include#include#include#includeusingnamespacestd;//====================================================typedefstructs
2、eat//坐标{intx;inty;intdi;}Seat;typedefstruct_stack//节点{Seatseat;struct_stack*next;}MyStack,Head;intmaze[10][10];//====================================================intInMaze();//初始化迷宫intPrintMaze();//打印迷宫voidDis(stack&);//走完后路径打印voidGetNext(Seat&,Seat&);//获取下一个
3、坐标voidInData(Seat&,Seat&,Seat&,Seat&);//初始化位置intNextPas(Seat&,Seat&,stack&);//判定下一个坐标是否通过//====================================================intmain(){intflag=0;stackroad;Seatstart,end,next,cur;while(1){InMaze();InData(start,end,cur,next);system("cls");P
4、rintMaze();flag=0;while(!road.empty())road.pop();while(1){while(cur.di<=4){++cur.di;maze[cur.x][cur.y]=2;if(cur.x==end.x&&cur.y==end.y){cur.di=8;road.push(cur);cout<<"成功走出!路径:";stacktemp;Seata;while(!road.empty()){a=road.top();road.pop();temp.push(a);}
5、Dis(temp);flag=1;break;}GetNext(cur,next);if(NextPas(cur,next,road)){cur=next;Sleep(500);system("cls");PrintMaze();}}if(flag==1)break;maze[cur.x][cur.y]=7;if(road.empty()){cout<<"无法走出";flag=1;break;}if(flag==1)break;cur=road.top();road.pop();}system("pause");}
6、return0;}//======================================================intInMaze()//初始化迷宫{intx,i,j;srand(time(NULL));for(i=0;i<10;++i){for(j=0;j<10;++j){x=rand()%2+1;if(i==0
7、
8、j==0
9、
10、i==9
11、
12、j==9)maze[i][j]=1;elseif(x==2)maze[i][j]=0;elseif(x==1)maze[i][j]=1;}}maze[1][1]=0;maze
13、[8][8]=0;return1;}intPrintMaze()//打印迷宫{for(inti=0;i<10;++i){for(intj=0;j<10;++j){if(i==1&&j==1)cout<<"▲";elseif(i==8&&j==8)cout<<"㊣";elseif(maze[i][j]==0)cout<<"";elseif(maze[i][j]==1)cout<<"■";elseif(maze[i][j]==2)cout<<"→";elseif(maze[i][j]==3)cout<<"→";elseif(maze[
14、i][j]==4)cout<<"↓";elseif(maze[i][j]==5)cout<<"↑";elseif(maze[i][j]==6)cout<<"←";elseif(maze[i][j]==7)cout<<"";elseif(maze[i
