迷宫递归输出全部结果.doc

#include #include #includeusing namespace std;/static int sum=0; /记录输出次数int Minlenth=0,num; /记录最短路径和相应的输出次数enum MazeCell B,E,VIA,U,D,R,L; /VIA走过的路,B墙,E空,U向上,D向下,R向右,L向左int row, cow;MazeCell *arr;struct Point int X;int Y;/int PrintPath(MazeCell *&arr,int row,int cow); /打印地图void Maze(MazeCell *&arr,Point cur, Point end,int row,int cow); /迷宫求解void CountLines(); /判断迷宫的行和列 void InputMaze(MazeCell *&arr,int row,int cow); /输入迷宫/void main()CountLines();arr=new MazeCell*row;for(int i=0;irow;i+)arri=new MazeCellcow;Point s =1,1;Point e=9,9;InputMaze(arr,row,cow);Maze(arr,s,e,row,cow);cout最短路径: Minlenth;coutn为第num条路径n;for(int i=0;irow;i+)delete arri;delete arr;/void Maze(MazeCell *&arr,Point cur, Point end,int row,int cow) /迷宫求解if(cur.X = row-1 | cur.Y = cow-1 | cur.X = 0 | cur.Y = 0 ) cout第+sum条路径:n;cout路径长度:PrintPath(arr,row,cow)endl;arrcur.Xcur.Y = E;elseif (arrcur.Xcur.Y+1 =E )Point t=cur;arrcur.Xcur.Y = R;t.Y+;Maze(arr,t,end,row,cow);if (arrcur.X+1cur.Y =E )Point t=cur;arrcur.Xcur.Y = D; t.X+;Maze(arr,t,end,row,cow);if (arrcur.X-1cur.Y =E )Point t=cur; arrcur.Xcur.Y = U;t.X-;Maze(arr,t,end,row,cow);if (arrcur.Xcur.Y-1 =E)Point t=cur; arrcur.Xcur.Y = L;t.Y-;Maze(arr,t,end,row,cow);arrcur.Xcur.Y = VIA; / 走过的路arrcur.Xcur.Y = E;/int PrintPath(MazeCell *&arr,int row,int cow) int Pathlenth=0;/记录路径长度for (int i=0;irow;i+)for (int j=0;jcow;j+)if (arrij=B) cout;else if (arrij=D) cout;Pathlenth+;else if(arrij=R)cout;Pathlenth+;else if(arrij=U)cout;Pathlenth+;else if(arrij=L)cout;Pathlenth+;else cout;coutPathlenth)Minlenth=Pathlenth;num=sum;return Pathlenth;/输入迷宫void InputMaze(MazeCell *&arr,int row,int cow)ifstream input(C:UsersHenryDesktopInput.txt);int k;for(int i=0;irow;i+)for(int j=0;jk;arrij=(MazeCell)k;/void CountLines()ifstream ReadFile(C:UsersHenryDesktopInput.txt);char line512;char b;int k=0;while(!ReadFile.eof()ReadFile.getline(line,512,n);row+;ReadFile.clo