7-33 地下迷宫探索 (30 分)

题目链接

#include
#include
#include
#include
using namespace std;
bool g[1010][1010],book[1010];
int n,m,s,amount;
bool fg = 0;
void dfs(int node){
    if(fg) cout<<' ';
    fg = true;
    cout<>n>>m>>s;
    for(int i = 0; i < m; i++){
        int u,v;
        cin>>u>>v;
        g[u][v] = g[v][u] = 1; 
    }
    book[s] = true;
    amount++;
    dfs(s);
    if(amount < n) cout<<' '<<0;
    return 0;
}