Description: Seeking two path is a data structure of a typical maze, a lot of books on data structures are introduced, the solution is as follows: From the beginning point proceed to the four directions to find, at every step, the points traversed value+1 (ie, the value of this node,+1), to prevent duplication of walking, and to the point pressure came into the stack (for paths), if you encounter the wall, or has passed the point it can not move forward ... ...
To Search:
File list (Check if you may need any files):
MathShortestPath\MathShortestPath.cpp
................\MathShortestPath.dsp
................\ReadMe.txt
................\StdAfx.cpp
................\StdAfx.h
....Path\MathShortestPath.cpp
........\MathShortestPath.dsp
........\StdAfx.cpp
........\StdAfx.h
MathShortestPath
MathPath
Download