- Category:
- Data structs
- Tags:
-
[Text]
- File Size:
- 1kb
- Update:
- 2013-07-09
- Downloads:
- 0 Times
- Uploaded by:
- YY
Description: Write a program to solve the maze, the maze is an m-by-n matrix of 0-1, where 0 is accessible, 1 means there is an obstacle, set entrance (1,1), export (m, n), each Accessible only from a mobile unit moves around eight directions took an accessible unit, the preparation procedures are given a path through the maze. Requirements: (1) Input 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 1,110,100,100,001,110,110
To Search:
File list (Check if you may need any files):
新建 文本文档.txt
Download