以一個m*n的長方形表示迷宮，0和1分別表示迷宮中的通路和障礙。設計一個程序，對任意設定的迷宮，求出一條從入口到出口的通路，或得出沒有通路的結論。

1.以深度优先的搜索方法进行路径的搜索

2.迷宮數據從文件中讀取-A rectangle that m* n maze, 0 and 1, respectively, the maze of pathways and barriers. Design a program, for any set of the maze, find a path from the entrance to export, or draw conclusions without access. 1. To the depth first search path search method 2. Maze data read from the file