Go: package main

import "fmt"

type node struct {
	id, d, v int
	adj      []node
}

var n int
var seen []bool
var graph []node

func max(a, b int) int {
	if a > b {
		return a
	}
	return b
}

func dfs(v, t int) int {
	// fmt.Printf("dfs(v %d, t %d) en:\n", v, t)
	seen[v] = true
	graph[v].v = t
	tt := t
	for _, vv := range graph[v].adj {
		if !seen[vv.id] {
			tt = max(tt, dfs(vv.id, tt+1))
		}
	}
	graph[v].d = tt + 1
	// fmt.Printf("dfs(v %d, t %d) ex: d %d\n", v, t, graph[v].d)
	return graph[v].d
}

func main() {
	fmt.Scan(&n)
	graph = make([]node, n+1)
	for i := 1; i <= n; i++ {
		var u, k, v int
		fmt.Scan(&u, &k)
		graph[u].id = u
		// 頂点uはk個の隣接頂点を持っている
		for j := 0; j < k; j++ {
			fmt.Scan(&v)
			var t node
			t.id = v
			graph[u].adj = append(graph[u].adj, t)
		}
	}
	// fmt.Println("n", n, "graph", graph)
	seen = make([]bool, n+1)
	// t := dfs(1, 1)
	v, t := 1, 1
	done := false
	for !done {
		tt := dfs(v, t)
		done = true
		for i := range seen {
			if !seen[i] {
				done = false
				v = graph[i].id
				t = tt
				break
			}
		}
	}
	for i := 1; i <= n; i++ {
		fmt.Printf("%d %d %d\n", i, graph[i].v, graph[i].d)
	}
}

C++: #include <iostream>
#include <vector>
using namespace std;

vector<int> graph[100];
int start[100],endt[100];
int cnt;

void dfs(int num){
	start[num] = ++cnt;
	for(int i = 0;i < graph[num].size();i++){
		if(graph[num][i] != num && !start[graph[num][i]] && !endt[graph[num][i]]) dfs(graph[num][i]);
	}
	endt[num] = ++cnt;
}

int main(){
	int n;
	cin >> n;
	for(int i = 0;i < n;i++){
		int now,m;
		cin >> now >> m;
		for(int j = 0;j < m;j++){
			int t;
			cin >> t;
			graph[now - 1].push_back(t - 1);
		}
	}
	dfs(0);
	for(int i = 0;i < n;i++){
		if(!endt[i]) dfs(i);
	}
	for(int i = 0;i < n;i++){
		cout << i + 1 << " " << start[i] << " " << endt[i] << endl;
	}
	return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

vector<int> d(100), f(100);
vector<vector<int>> G(100);
int cnt = 1;

void dfs(int i) {
    d[i] = cnt++;
    for (auto v : G[i]) {
        if (d[v] == 0) dfs(v);
    }
    f[i] = cnt++;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    for (int i = 0; i < n; i++) {
        int u, k;
        cin >> u >> k;
        for (int j = 0; j < k; j++) {
            int v;
            cin >> v;
            G[u - 1].push_back(v - 1);
        }
    }
    for (int i = 0; i < n; i++) {
        if (d[i] == 0) dfs(i);
    }
    for (int i = 0; i < n; i++) {
        cout << i + 1 << " " << d[i] << " " << f[i] << endl;
    }

    return 0;
}

C++: #include <iostream>
#include <stack>
using namespace std;
static const int N =100;
static const int white=0;
static const int gray=1;
static const int black=2;

int n,M[N][N];
int color[N],d[N],f[N],tt;
int nt[N];

int next(int u){
    for (int v=nt[u];v<n;v++){
        nt[u] = v+1;
        if(M[u][v])return v;    }
        return -1;
}

void dfs_visit(int r){
    for(int i=0;i<n;i++)nt[i]=0;
    
    stack<int>s;
    
    s.push(r);
    color[r]=gray;
    d[r]=++tt;
    
    while(!s.empty()){
        int u=s.top();
        int v=next(u);
        if(v!=-1){
            if(color[v]==white){
                color[v]=gray;
                d[v]=++tt;
                s.push(v);
            }
        }else{
            s.pop();
            color[u]=black;
            f[u]=++tt;
        }
    }
}
void dfs(){
    for(int i=0;i<n;i++){
        color[i]=white;
        nt[i]=0;
    }
    tt=0;
    for(int u=0;u<n;u++){
        if(color[u]==white)dfs_visit(u);
    }
    for(int i=0;i<n;i++){
        cout<<i+1<<" "<<d[i]<<" "<<f[i]<<endl;
        
    }
    }
    int main(){
        int u,k,v;
        cin>>n;
        for(int i=0;i<n;i++){
            for(int j=0;j<n;j++)M[i][j]=0;
        }
        for(int i=0;i<n;i++){
            cin>>u>>k;
            u--;
            for(int j=0;j<k;j++){
                cin>>v;
                v--;
                M[u][v]=1;
            }
        }
        dfs();
        return 0;
}

C++: #include<iostream>
#include<vector>
#include<limits.h>
#include<stack>
#include<string>
using namespace std;

struct Vertex{
	int deg;
	vector<int> adj;
	int checked;
	int parent;
};

int out(vector<int> &A){
	int n=A.size();
	int i;
	if (n==0){
		cout << "nothing" <<endl;
	}else if(n==1){
		cout << A[0] << endl;
	}else{
		for (i=0;i<=n-2;i++){
			cout << A[i] << " ";
		}
		cout << A[n-1] <<endl;
	}
}

int Next(vector<Vertex> &L,vector<int> &d, vector<int> &f, int cur, int count){
	int next,i,v;
	if(L[cur].deg==0){
		next=L[cur].parent;
		f[cur]=count;
		return next;
	}
	
	for (i=0;i<L[cur].deg;i++){
		v=L[cur].adj[i];
		if(L[v].checked==0){
			break;
			}
		}
		if(i==L[cur].deg){
			next=L[cur].parent;
			f[cur]=count;
		}else{
			next=v;
			L[next].parent=cur;
			L[next].checked=1;
			d[next]=count;
		}
	return next;
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	
	int n,i,j;
	cin >> n;
	
	vector<Vertex> L(n);
	vector<int> d(n);
	vector<int> f(n);
	
	int id,de,v;
	for (i=0;i<n;i++){
		cin >> id >> de;
		L[id-1].deg=de;
		for (j=0;j<de;j++){
			cin >> v;
			L[id-1].adj.push_back(v-1);
		}
		L[id-1].checked=0;
		L[id-1].parent=-1;
	}
	
	int cur=0;
	int next,count=0;
	
	while(1){
		count++;
		for (i=0;i<n;i++){
			if(L[i].checked==0){
				break;
			}
		}
		if (i==n){
			break;
		}
		L[i].checked=1;
		d[i]=count;
		cur=i;
		while(1){
			count++;
			next=Next(L,d,f,cur,count);
			if (next==-1){
				break;
			}
			cur=next;
		}
		}
	for (i=1;i<n+1;i++){
		cout << i << " " << d[i-1] << " " << f[i-1] <<endl;
	}
	return 0;
}

C++: #include <cstdio>
#include <cstring>
#include <stack>
#define N 110
using namespace std;
int n;
int m[N][N];
int used[N];
int time = 1;
int _start[N];
int _end[N];
int getnext(int u){
    for(int i = 1; i <= n; i++){
        if(m[u][i] == 1) return i;
    }
    return -1;
}
void dfs(int root){
    used[root] = 1;
    _start[root] = time++;
    stack<int> s;
    s.push(root);
    while(!s.empty()){
        int u = s.top();
        int v = getnext(u);
        if(v != -1 && used[v] == 0){
            used[v] = 1;
            _start[v] = time++;
            s.push(v);
        } else{
            _end[u] = time++;
            s.pop();
        }
    }
}
int main(){
    for(int i = 0; i < N; i++) for(int j = 0; j < N; j++) m[i][j] = 0;
    for(int i = 0; i < N; i++) used[i] = 0;
    scanf("%d", &n);
    for(int p = 0; p < n; p++){
        int node, k;
        scanf("%d %d", &node, &k);
        for(int i = 0; i < k; i++){
            int b;
            scanf("%d", &b);
            m[node][b] = 1;
        }
    }
    for(int i = 1; i <= n; i++) if(used[i] == 0) dfs(i);
    for(int i = 1; i <= n; i++){
        printf("%d %d %d\n", i, _start[i], _end[i]);
    }
    return 0;
}