Description: Recursive solution of the maze problem, enter a maze of 1,0 matrices, 0 representatives may go a representative can not walk through the recursion to find the path from the entrance to the exit, and output
To Search:
File list (Check if you may need any files):
maze\Debug\maze.exe
....\.....\maze.ilk
....\.....\maze.pdb
....\maze\Debug\BuildLog.htm
....\....\.....\maze.exe.embed.manifest
....\....\.....\maze.exe.embed.manifest.res
....\....\.....\maze.exe.intermediate.manifest
....\....\.....\maze.obj
....\....\.....\maze.pch
....\....\.....\mt.dep
....\....\.....\stdafx.obj
....\....\.....\vc90.idb
....\....\.....\vc90.pdb
....\....\maze.cpp
....\....\maze.vcproj
....\....\ReadMe.txt
....\....\stdafx.cpp
....\....\stdafx.h
....\....\targetver.h
....\maze.ncb
....\maze.sln
....\maze.suo
....\....\Debug
....\Debug
....\maze
maze
Download