数据结构经典题.doc

" " "以一个mXn的长方阵表示迷宫，0和1分别表示迷宫中的通路和障碍。设计一个" "程序，对任意设定的迷宫，求出一条从入口到出口的通路，或得出没有通路 " "的结论。 " "#include<iostream> " "using namespace std; " "class T //定义描述迷宫中当前位置的结构类型 " "{ " "public: " "int x; //x代表当前位置的行坐标 " "int y; //y代表当前位置的列坐标 " "int dir; //0:无效,1:东,2:南,3:西,4:北 " "}; " "class LinkNode //链表结点 " "{ " "friend class Stack; " "public: " "T data; " "LinkNode *next; " "}; " "class Stack " "{ " "private: " "LinkNode *top; //指向第一个结点的栈顶指针 " "public: " "Stack(); //构造函数，置空栈 " "~Stack(); //析构函数 " "void Push(T