Introduction - If you have any usage issues, please Google them yourself
Data structures, maze mouse problem solving maze is a rectangular area, it has an entrance and an exit. Contains in the maze of internal walls or obstacles that can not be crossed. Maze entrance in the upper left corner of the exports in the lower right corner. Is assumed that a matrix of n* m to describe the labyrinth, represented by the position (1,1) inlet, (n, m) said outlet, n and m respectively represent the number of rows and number of columns of the maze. Each position are available in the maze of its row and column numbers specified. In the matrix, when and only when in the position (i, j) at an obstacle when its value is 1, otherwise its value is zero. (Ie 0 means pass, 1 can not.) It is assumed that the mouse from the top left corner [1,1] into the maze, write algorithms to seek a path out from the lower right corner [m, n]. Maze mice is a typical can solve the problem with a stack. The subject requirements we first constructed an active input dimension but randomly generate