Description: Write a program to solve the maze, a labyrinth is 0-1 m matrix of rows and n columns, where 0 is accessible, 1 there are obstacles, set entrance (1,1), export (m, n), each Mobile only moved around eight directions a barrier-free unit took an accessible unit, programmed to give a path through the maze. Requirements: (1) enter the maze m* n matrix, such as: 6 9 0 1 0 0 0 1 1 0 0 1 0 0 0 1 1,011,011,000,011,110,111 1 0,111,010,010,000,111,011 0 (2) output by the labyrinth path (path process the reflection display), if there is no maze no roads, the output: there is no path.
To Search:
File list (Check if you may need any files):
maze.c
Download