Description: First of all, the realization of a list of the stack for the type of storage structure, and then the preparation of a maze to solve the non-recursive procedures. Obtained access to triples (i, j, d) the form of output, including: (i, j) indicative of a maze coordinates, d that coordinates the direction of the next walk. Such as: the following data for the maze, the output of a channel as follows: (1,1,1), (1,2,2), (2,2,2), (3,2,3), (3,1 , 2), ... ....
To Search:
File list (Check if you may need any files):
migong.cpp
Download