Introduction - If you have any usage issues, please Google them yourself
Given an n (n < 20) row m (m < 20) out 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