Description: The preparation of a program to solve maze problems. Maze by m lines n set out in two-dimensional array, 0, said barrier-free, 1 that there is an obstacle. Entrance located (1,1), exports (m, n), each from a barrier-free unit can only move in four directions around the office of a barrier-free unit. Programming the maze of arbitrary, derived from the entrance to an export pathway, or no access to draw conclusions. Algorithm input: the representative of the coordinates of the entrance of the maze algorithm output: the results through the maze.
To Search:
File list (Check if you may need any files):
迷宫问题
........\Debug
........\luodan.txt
........\main.cpp
........\maze.txt
........\mi.txt
........\mm.txt
........\stack.cpp
........\stack.h
........\新生成迷宫.txt
........\迷宫问题.dsp
........\迷宫问题.dsw
........\迷宫问题.ncb
........\迷宫问题.opt
........\迷宫问题.plg
迷宫问题课程设计报告.doc
Download