迷宫求解问题（Maze problem solving）.docVIP

迷宫求解问题（Maze problem solving） # includes malloc.h # includes stdio.h # includes conio.h # define m 6 / * 规定迷宫的行数 * / # define n 4 / * 规定迷宫的列数 * / int i = 0; typedef struct shuju { int date; int flag; / * 判断这个位置是否被走过, 使其产生记忆效果 * / } shu; typedef struct maze int c; int flag; int direct; int x; int y; struct maze * next; } mg; mg * top, * p; mg * pop (int bb, int xx, int yy, shu t [m] [n]) / * 入栈操作 * / {int p, j2; the + +; p = (mg) malloc (sizeof (mg)); p - c = bb. p - flag = 1; p - direct = 4; p - x = xx; p - y = yy; if (i = = 1) (top = p; top - next = null; } else {p - next = top; top = p; } clrscr (); for (p = 0; 0 m, p + +) {printf (\ n); for (j2 = 0; j2); j2 + +) if (t [i2] [j2] date = = 8) {textcolor (yellow). cprintf (% 3d, t [i2] [j2] date); } else {textcolor (white); cprintf (% 3d, t [i2] [j2] date); } } for (p = 0; p 80; (2 + +) / * 时间延迟 * / delay (1000). } int way (int x1, int yl, shu s [m] [n]) / * 寻找路径函数 * / {int x, y, f = 0. int c, total. while (top! / * 以下是在四个方向上进行判断 = null) 通就入栈, 不通就进行下个方向的 判断, 如果四个方向都不通, 就出栈 * / if (top - flag = = 1) {x = top - x; y = top - y; if (x = = x 1 y = = yl) {f = 1; break; 判断右方向} / * * / if (top - direct = = 4) (top) direct - -; if (0 = y + 1 y + 1 n) / * 判断数组的下标是否超过了规定的界限 * / if (d [x] [m + 1] date = = 0 d [x] [m + 1].flag = = 0) pop (d [x] [m + 1] date = 8 x, y + 1, d). } else if (top - direct = = 3) / * 判断下方向 * / (top) direct - -; if (0 = x + 1 x + 1 m) if (d [x + 1] [y] date = = 0 d [x + 1] [y].flag = = 0) pop (d [x + 1] [y] date = 8, x + 1, y, d); } else if (top - direct = = 2) / * 判断左方向 * / (top) direct - -; if (0 = y - 1 y - 1 n) if (d [x] [y - 1) date = = 0 d [x] [y - 1].flag = = 0) pop (d [x] [y - 1) date = 8 x, y - 1, s); } else if (top - direct = = 1) / * 判断上方?? * / (top) direct - -; top - flag = 0; if (0 = x - 1 x 1 m) if (d [x - 1] [y] date = = 0 d [x - 1] [y].flag = = 0) pop (d [x - 1] [y] date = 8 x 1, y, d); } } else {d [x] [top top - - y] date = 0; d [top - x