Description: Non-recursive maze solving the problem. Enter the maze formed by 10 matrix, with non-recursive method, that is to build a stack to record the traversed path, find the exit. Furthermore, each step of its output.
To Search:
- [migong] - Classic maze problem, then map the user
- [maze] - To achieve the functions of Maze, the pa
File list (Check if you may need any files):
非递归求迷宫问题\Debug\非递归求迷宫问题.exe
................\.....\非递归求迷宫问题.ilk
................\.....\非递归求迷宫问题.pdb
................\非递归求迷宫问题\Debug\BuildLog.htm
................\................\.....\Maze.obj
................\................\.....\mt.dep
................\................\.....\vc90.idb
................\................\.....\vc90.pdb
................\................\.....\非递归求迷宫问题.exe.intermediate.manifest
................\................\Maze.cpp
................\................\SeqStack.h
................\................\Stack.h
................\................\非递归求迷宫问题.vcproj
................\................\非递归求迷宫问题.vcproj.LIENHUA34.HP.user
................\非递归求迷宫问题.ncb
................\非递归求迷宫问题.sln
................\非递归求迷宫问题.suo
................\................\Debug
................\Debug
................\非递归求迷宫问题
非递归求迷宫问题
Download