Description: Manually generate a nm matrix maze to find a path from the entry point to the exit point. Maze with a lot of the fork, search the entire maze, which is actually the integrated operation of the stack and backtracking algorithm. To achieve the main functions: (1) create a maze, the input the maze data storage to a two-dimensional array. (2) shows the maze, will create the maze to the square in the form displayed. (3) Find the path, respectively, with a non-recursive algorithm and the recursive algorithm to find the maze path. (4) output path, with a triple (i, j, d) in the form of output and the form of a square of the output. (5). The recovery maze, Discover after the maze data recovery.
To Search:
File list (Check if you may need any files):
迷宫问题\迷宫.cpp
........\迷宫问题.doc
迷宫问题
Download