堆栈遍历求解迷宫(程序说明书).docVIP

《数据结构》 课程设计姓名 虞嘉尧班级 信科1301学号 程序名：迷宫求解 实验环境：Visual c++ 6.0 语言c++ 实现功能：随机生成一个迷宫并判断此迷宫是否走得通 主要算法：从入口出发，以右、下、上、左方向顺序试探下一坐标是否走得通，同时将可走方位保存，再进行下一步试探，用堆栈方式实现迷宫遍历。运行界面：实例：主要源代码： #include iostream #include windows.h #include time.h #include stack using namespace std; typedef struct seat//坐标 {int x;int y;int di; }Seat;typedef struct _stack//节点 {Seat seat;struct _stack *next; }MyStack, Head; int m,n; int maze[30][30]; int InMaze();//初始化迷宫 int PrintMaze();//打印迷宫void Dis(stackSeat );//走完后路径打印 void GetNext(Seat , Seat );//获取下一个坐标 void InData(Seat , Seat , Seat , Seat );//初始化位置 int NextPas(Seat , Seat , stackSeat );//判定下一个坐标是否通过int main() {int flag = 0; stackSeat road;Seat start, end, next, cur;while(1){InMaze();InData(start, end, cur, next);system(cls);PrintMaze();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\n\n成功走出!\n\n路径:\n;stackSeat temp;Seat a;while(!road.empty()){a = road.top();road.pop();temp.push(a);}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\n\n无法走出\n\n;flag = 1;break;}if(flag == 1)break;cur = road.top();road.pop();}system(pause);}return 0; }int InMaze()//初始化迷宫 {coutThe size of maze:endl; cinmn; int x, i, j;srand (time(NULL));for(i = 0; i m; ++i) {for(j = 0; j n; ++j){x = rand() % 2 + 1;if(i == 0 || j == 0 || i == m-1 || j == n-1)maze[i][j] = 1;else if(x == 2)maze[i][j] = 0;else if(x == 1)maze[i][j] = 1;}}maze[1][1] = 0;maze[m-2][n-2] = 0;return 1; }int PrintMaze()//打印迷宫 {for(int i = 0; i m; ++i){for(int j = 0; j n; ++j){if(i == 1 j == 1)cout▲;else if(i == m-2 j == n-2)cout★;else if(maze[i][j] == 0)cout ;else if(maze[i][j] == 1)cout■;else if(maze[i][j] == 2)cout→;else if(maze[i][j] == 3)cout→;else if(maze[i][j] == 4)cout↓;else if(maze[i][j] == 5)cout↑;else if(maze[i]