Description: The implementation of the code is a simple maze. A m* n the long square maze, 0 and 1, respectively pathways and obstacles in the maze. Design a program, any set of maze, find a path from the entrance to the exit, excluded conclusions drawn not go the same way. Basic requirements: First a linked list storage structure stack type, and then write a non-recursive program to solve the maze, the obtained path triples (i, j, d) in the form of output, of which: (i i) directing the maze of a coordinate, d go to the next coordinate direction.
To Search:
File list (Check if you may need any files):
maze
....\Debug
....\.....\maze.exe
....\.....\maze.ilk
....\.....\maze.obj
....\.....\maze.opt
....\.....\maze.pch
....\.....\maze.pdb
....\.....\vc60.idb
....\.....\vc60.pdb
....\maze.cpp
....\maze.dsp
....\maze.dsw
....\maze.h
....\maze.ncb
....\maze.opt
....\maze.plg
....\maze.txt
....\maze1.txt
....\maze2.txt
Download