Description: This procedure is mainly used to achieve the maze problem stack. Algorithm used in a non-recursive algorithm, enter the number of rows for the maze and the number of rows, and then enter the location in the corresponding value (0 indicates that the location of Qualcomm, said the location of a barrier). Output is based on triples (i, j, d) form, in which (i, j) that one of the coordinates of the maze, d that the next go the direction of coordinates,
To Search:
File list (Check if you may need any files):
尹素芳20070830324
.................\gggg.c
.................\gggg.exe
.................\readme.txt
.................\上机实习总结报告.doc