迷宫问题-C++代码

#include#include#include#include #include SQ_Stack.husing namespace std;struct Visitedint num; /是否是通路（1或0）int visited; /判断是否已被访问（1或0）;class MiGongprivate:Visited maze100100; /存储迷宫的矩阵int n; /迷宫大小（n*n）int pow; /判断方向的变量public:void creat() /建造迷宫int choose,i,j;while(1)cout1.自动输入endl;cout2.手动输入endl;coutchoose;system(cls);if(choose=1) /自动输入coutn;for(i=0;in;i+) /访问位初始化，赋值为0for(j=0;jn;j+)mazeij.visited=0;srand(unsigned)time(0); cout你生成的迷宫为(n*n型):endl;for( i=0;in;i+)for( j=0;jn;j+)if(i=0|j=0|i=n-1|j=n-1)/若是边界，则置为1mazeij.num=1;elsemazeij.num=(rand()%(2-0);if(i=1&j=1)/入口置为0mazeij.num=0;else if(i=n-2&j=n-2)/出口置为0mazeij.num=0;coutmazeij.num ;if(j=n-1)coutendl;coutendl;break;else if(choose=2) /手动输入coutn;for(i=0;in;i+)/访问位初始化为0for(j=0;jn;j+)mazeij.visited=0;system(cls);while(1)int c;cout1.当前页面输入：endl;cout2.文件输入：c;if(c=1)system(cls);cout请手动输入迷宫：endl;int mi;cout你生成的迷宫为(n*n型):endl;for( i=0;in;i+)for( j=0;jmi;mazeij.num=mi;coutmazeij.num ;if(j=n-1)coutendl;coutendl;coutendl;break;else if(c=2)ifstream infile(输入迷宫.txt);for(i=0;in;i+)for(j=0;jmazeij.num;coutmazeij.num ;if(j=n-1)coutendl;infile.close();break;elsecout输入错误，请重新输入！;system(pause);system(cls);continue;break;elsecout输入错误，请重新输入！;system(pause);system(cls);continue;void seek() /寻找路径SQ_Stack Stack;/定义栈Stack.InitStack();/栈初始化if(mazen-2n-2.num) return; /若出口为0，则跳出int i=n-2,j=n-2;int pow,a=0;do /开始寻找线路if(!mazeij.num)&(mazeij.visited=0)/如果是通路且从未被访问if(i!=Stack.getTI()|(j!=Stack.getTJ()/如果该点未入栈，则入栈，访问该点Stack.push(i,j);mazeij.visited=1;/且把访问位置为1if(i=1&j=1)/如果是出口则跳出全部循环a=1;break;i=i;/初始向左访问j=j-1;pow=0;else/如果不是通路int back1,back2;pow+;/方向位改变i=Stack.getTI();/回到访问的点j=Stack.getTJ();while(1) if(pow=1)/向左一位访问 j-;if(i=Stack.getI()&(j=Stack.getJ()/如果是来路pow+;/则改变方向位i=Stack.getTI();/回到访问的点j=Stack.getTJ();continue;elsebreak; else if(pow=2)/向上一位访问 i-;if(i=Stack.getI()&(j=Stack.getJ()pow+;i=Stack.getTI();j=Stack.getTJ();continue;elsebreak; else if(pow=3)/向下一位访问i+;if(i=Stack.getI()&(j=Stack.getJ()pow+;i=Stack.getTI();j=Stack.getTJ();continue;elsebreak;else if(pow=4)/向右一位访问j+;if(i=Stack.getI()&(j=Stack.getJ()pow+;i=Stack.getTI();j=Stack.getTJ();continue;elsebreak;elseStack.pop(back1,back2);/若四个方向均不通，就弹栈mazeback1back2.num=1;/将该点的通路位置为1i=Stack.getTI();/继续往回的点找通路j=Stack.getTJ();pow=0;break;if(Stack.StackEmpty()/如果栈为空，则表示无通路。break;while(a=0);if(!Stack.StackEmpty()int x,y;int v=Stack.StackLength()-1; /v用来访问栈int total=Stack.StackLength();while(total)Stack.visit(x,y,v);mazexy.num=8;total-;system(pause);system(cls);cout线路为：endl;ofstream outfile(迷宫线路.txt,ios:app);for(int i=0;in;i+)for(int j=0;jn;j+)if(mazeij.num=8)coutsetw(2)setiosflags(ios:left) ;cout.width(2);outfilesetiosflags(ios:left) ;elsecoutsetw(2)setiosflags(ios:left)mazeij.num ;cout.width(2);outfilesetiosflags(ios:left)mazeij.num ;if(j=n-1)coutendl;outfileendl;outfileendl;Stack.output();elsesystem(pause);system(cls);Stack.output();/输出通路Stack.DestroyStack();/销毁栈void menu()MiGong m;/定义MiGong类int i=0;cout*欢迎进入迷宫游戏*endl;coutendl;cout 进入游戏 endl;coutendl;cout*endl;docreat();/建立迷宫seek();/寻找通路whil