深度优先遍历 题解

题目在主页，如有出错请指出

include <bits/stdc++.h>

using namespace std;

int a[105][105], in[105], out[105], cnt = 0;
bool vis[105];

void dfs(int x)
{
vis[x] = 1;
in[x] = ++ cnt;
for (int i = 1;i <= a[x][0];i++)
{
int v = a[x][i];
if (vis[v] == 0) dfs(v);
}
out[x] = ++cnt;
}

int main()
{
int n;
cin >> n;
for (int i = 1;i <= n;i++)
{
int u, k;
cin >> u >> k;
a[u][0] = k;
for (int j = 1;j <= k;j++)
cin >> a[u][j];
}
for (int i = 1;i <= n;i++)
if (vis[i] == 0) dfs(i);
for (int i = 1;i <= n;i++)
cout << i << ' ' << in[i] << ' ' << out[i] << endl;
return 0;
}