Introduction - If you have any usage issues, please Google them yourself
The preparation of a program to solve maze problems. Maze by m lines n set out in two-dimensional array, 0, said barrier-free, 1 that there is an obstacle. Entrance located (1,1), exports (m, n), each from a barrier-free unit can only move in four directions around the office of a barrier-free unit. Programming the maze of arbitrary, derived from the entrance to an export pathway, or no access to draw conclusions. Algorithm input: the representative of the coordinates of the entrance of the maze algorithm output: the results through the maze.