迷宫问题的算法(优于广度优先,深度优先,递归).-maze of algorithm (priority than breadth, depth priority, recursive).

这是一个用递归来求迷宫出路的程序，不是用栈，用栈的程序好象书上有。但是我没有想出一个方法来产生迷宫，如果用楼主所说的输入那也太麻烦了。我于是暂时用一个不科学的方法来产生迷宫，十分不理想。我顺便问一下有谁知道用一个递归或栈的办法来产生迷宫？-This is a recursive to seek a way out the maze procedure, not to use the stack, with stack of books seems to have a program. But I

递归算法。最经典的汉诺塔递归算法，另外还有一个迷宫的递归。很不错。-Recursive algorithm. The most classic Tower of Hanoi recursive algorithm, in addition to a maze of recursion. Very good.

Java中栈.回溯.迷宫问题求解。非递归实现。初学者适用-Java stack. Backtracking maze problem solving