Description: Said in an m* n long square maze, the maze of pathways and barriers 0 and 1, respectively. Design a program, for any set of the maze, find a pathway from the entrance to the exit, or come to the conclusion there is no pathway. Requirements: First, a stack type, and then write a non-recursive procedure for solving the maze. Obtained path output in the form of triples (i, j, d), where (i, j) indicate the maze coordinates, d come to the next coordinate direction. Maze for 8* 8, a two-dimensional array to store the maze of information, the entrance for the (1,1), export (8,8), the input format: 0 by 1 roadblock. Two-dimensional array (0, i), (I, 0), (10, i), (i, 10) defaults to 1, on behalf of the non-through. Output format: seek the path of output in the form of triples (i, j, d), where (i, j) indicate the maze coordinates, d come to the next coordinate direction.
To Search:
File list (Check if you may need any files):
迷宫求解问题\Debug\maze.obj
............\.....\maze.sbr
............\.....\vc60.idb
............\.....\vc60.pdb
............\.....\迷宫求解问题.bsc
............\.....\迷宫求解问题.exe
............\.....\迷宫求解问题.ilk
............\.....\迷宫求解问题.pch
............\.....\迷宫求解问题.pdb
............\maze.cpp
............\迷宫求解问题.dsp
............\迷宫求解问题.dsw
............\迷宫求解问题.ncb
............\迷宫求解问题.opt
............\迷宫求解问题.plg
............\Debug
迷宫求解问题
Download