本演示程序中，首先实现一个以链表做存储结构的栈类型，然后编写一个求解迷宫的非递归程序。求得的通路以三元组（i，j，d）的形式输出，其中：（i，j）指示迷宫中的一个坐标的方向。-This demo program, the first to do to achieve a linked list storage structure stack type, and then write a non-recursive procedure to solve the maze. Obtained access to triples (i, j, d) in the form of outputs, including: (i, j) indicates the maze of one coordinate direction.