迷宫问题

一个迷宫可用上图所示方阵[m,n]表示，0表示能通过，1 表

示不能通过。现假设耗子从左上角[1,1]进入迷宫，编写算法，寻

求一条从右下角 [m,n] 出去的路径-Maze

A maze of available shown on the square [m, n], 0 through a table

Means you can not pass. It is assumed that the mouse from the upper left corner [1,1] into the maze to write algorithms to find

Request one from the bottom right corner [m, n] out of the path