迷宫问题-C++代码(共8页).doc

精选优质文档-倾情为你奉上#include#include#include#include #include SQ_Stack.husing namespace std;struct Visitedint num; /是否是通路（1或0）int visited; /判断是否已被访问（1或0）;class MiGongprivate:Visited maze100100; /存储迷宫的矩阵int n; /迷宫大小（n*n）int pow; /判断方向的变量public:void creat() /建造迷宫int choose,i,j;while(1)cout1.自动输入endl;cout2.手动输入