该程序解决的是迷宫问题。给定一个n（n<20）行m(m<20)列的迷宫，迷宫每个位置用整数1和0表示，0表示墙，1表示通道，给出迷宫起点（x0，y0）和终点（x1，y1），求出起点到终点的最短路径。-The procedure to solve the maze problem. Given an n (n < 20) row m (m < 20) out of the maze, the maze of each position with the integer 1 and 0, 0 wall, one said channel, given the maze starting point (x0, y0) and end (x1, y1), obtained from the shortest path to the end.