输入第一行给出三个正整数，分别表示地下迷宫的节点数N（1

cin >> N >> M >> K;

G->Nv = N;

G->Ne = M;

//邻接矩阵初始化

for( int i = 1; i Nv; i++){

for( int j = 1; j Nv; j++){

G->Date[i][j] = 0;

}

}

//往邻接矩阵赋值

for(int i = 1; i Ne; i++ ){

int a,b;

cin >> a >> b;

G->Date[a][b] = 1;

G->Date[b][a] = 1;

}

}

//dfs遍历

void DFS_Graph(PtrGraph G,int x){

if (cnt == 0)

cout

DFS_Graph(G,i);

cout

int Nv;