seeking maze exports from the entrance to the path of all the procedures for a c...

代码说明：

求迷宫中从入口到出口的所有路径是一个经典的程序设计问题。由于计算机解迷宫室，通常用的是“穷举求解”的方法，即从入口出发，顺某一方向向前探索，若能走通，则继续往前走；否则沿原路退回，换一个方向在继续探索，直到所有可能的通路都探索到为止。为了保证在任何位置上都能沿原路返回，显然需要用一个后进先出的结构来保存从入口到当前位置的路径。因此，在球迷宫通路的算法中应用“栈”也就是自然而然的事了。 -seeking maze exports from the entrance to the path of all the procedures for a classic design problem. The computer maze room, normally used was "exhaustive solution" approach, that is, from the entrance, with a direction to explore, if we can follow links, will continue to move forward; Otherwise, return along the same route, a direction for the continued exploration and until all possible pathway to date has explored. To ensure that in any position along the same route can return, obviously need a last-in, first-out to preserve the structure from the entrance of the current location of the path. Therefore, in the Palace fans access algorithm application "stack" is naturally a thing of the past.