Description: A m* n grid of a maze (that has m lines, n out), which may also not go away, if that can go with 1, 0 that can not leave, this document is read into m* n data and the starting point and end point (the starting point and end point are used to describe the two data, respectively, the point that the line number and column number). Programming you have to find all possible roads, the request path does not repeat the point, can only be walking up and down around the four directions. If a road is not feasible, then output the corresponding information (that have no use-l).
To Search:
File list (Check if you may need any files):
MiGong.cpp
Download