Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

type vertexId int

type vertex struct {
	id vertexId
	firstVisitAt int
	finishVisitAt int
	adjs []vertexId
}

func createVertex(id int, adjsInt []int) vertex {
	adjs := make([]vertexId, len(adjsInt))
	for i := 0; i < len(adjs); i++ {
		adjs[i] = vertexId(adjsInt[i])
	}
	return vertex{
		id: vertexId(id),
		firstVisitAt: 0,
		finishVisitAt: 0,
		adjs: adjs,
	}
}

func (v *vertex) doesAllAdjsVisited(vertices []vertex) bool {
	for _, vId := range v.adjs {
		adj := vertices[vId-1]
		if !adj.isVisited() {
			return false
		}
	}
	return true
}

func (v *vertex) isFirstVisit() bool {
	return v.firstVisitAt == 0
}

func (v *vertex) isVisited() bool {
	return v.firstVisitAt > 0
}

func (v *vertex) nextVertex(vertices []vertex) (vertexId, error) {
	for _, vId := range v.adjs {
		adj := vertices[vId-1]
		if !adj.isVisited() {
			return vId, nil
		}
	}
	return vertexId(-1), fmt.Errorf("illegal")
}

func dfs(currentId vertexId, timestamp int, vertices []vertex) int {
	timestamp = timestamp + 1
	currentVertex := &vertices[currentId-1]
	if currentVertex.isFirstVisit() {
		currentVertex.firstVisitAt = timestamp
	}
	for !currentVertex.doesAllAdjsVisited(vertices) {
		nextVertexId, _ := currentVertex.nextVertex(vertices)
		timestamp = dfs(nextVertexId, timestamp, vertices)
	}
	timestamp = timestamp + 1
	currentVertex.finishVisitAt = timestamp
	return timestamp
}

func main() {
	sc := bufio.NewScanner(os.Stdin)
	sc.Split(bufio.ScanWords)

	n, err := nextInt(sc)
	if err != nil {
		panic(err)
	}

	vertices := make([]vertex, n)
	for i := 0; i < n; i++ {
		id, err := nextInt(sc)
		if err != nil {
			panic(err)
		}
		adjN, err := nextInt(sc)
		if err != nil {
			panic(err)
		}
		adjs := make([]int, adjN)
		for j := 0; j < adjN; j++ {
			adjId, err := nextInt(sc)
			if err != nil {
				panic(err)
			}
			adjs[j] = adjId
		}
		vertices[i] = createVertex(id, adjs)
	}

	dfs(vertexId(1), 0, vertices)

	for i := 0; i < n; i++ {
		fmt.Printf("%d %d %d\n", vertices[i].id, vertices[i].firstVisitAt, vertices[i].finishVisitAt)
	}
}

func nextText(sc *bufio.Scanner) string {
	sc.Scan()
	return sc.Text()
}

func nextInt(sc *bufio.Scanner) (int, error) {
	return strconv.Atoi(nextText(sc))
}

C++: #include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <queue>
#include <cmath>
#include <map>

using namespace std;
vector<pair<int,int> > ans(100);
vector<vector<int> > da(100);
vector<bool> ju(100,false);

void dfs(int m,int &ti){
    bool ch=true;
    for(int i=0;i<da[m].size();i++){
        if(!ju[da[m][i]]){
            ju[da[m][i]]=true;
            ch=false;
            ti++;
            ans[da[m][i]].first=ti;
            dfs(da[m][i],ti);
        }
    }
    ti++;
    ans[m].second=ti;
}

int main(){
    int n,ti=0;
    cin >> n;
    for(int i=0;i<n;i++){
        int x;
        cin >> x;
        int y;
        cin >> y;
        vector<int> iin(y);
        for(int j=0;j<y;j++){
            cin >>iin[j];
            iin[j]--;
        }
        da[x-1]=iin;
    }
    for(int i=0;i<n;i++){
        if(!ju[i]){
            ju[i]=true;
            ti++;
            ans[i].first=ti;
            dfs(i,ti);
        }
    }
    for(int i=0;i<n;i++){
        cout << i+1 << ' ' << ans[i].first << ' ' << ans[i].second << endl; 
    }
}

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 M[N][N], color[N], d[N], f[N], nt[N];
int tt,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] = BLACK;
	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 j = 0; j < n; j++) {
		if(color[j] == WHITE) {
			dfs_visit(j);
		}
	}
	
	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 i = 0; i < k; i++ ) {
	       cin >> v;
	       v--;
	       M[u][v] = 1;	
	    }		
	}
	
	
	dfs();
	
	return 0;
}

C++: #include <utility>
#include <algorithm>
#include <iostream>
#include <queue>
#include <stack>


using namespace std;

int N;
int D[100+10] = {};
int U = 0;
int K[100+10] = {0};
int V = -1;
int G[100+10][100+10] = {0};
int curtime_st[100+10] = {0};
int curtime_en[100+10] = {0};



//stack dst   queue bfs


int time_ = 1;
int prev1 = 0;
int prev_b = 0;
void dfs(int cur){
  if (cur == -1)return;//??¢??±
  if (curtime_st[cur] == 0)curtime_st[cur] = time_;

  D[cur] = 0;
  time_ += 1;
  //
  //cerr << "visiting " << cur << " " << time_ - 1  << endl;
  
  for(int dst=1;dst<=N;++dst){
    if(D[dst] == -1 && G[cur][dst] == 1){
      dfs(dst);
	}
  }
  if(curtime_en[cur] == 0 || curtime_en[cur] == curtime_st[cur])curtime_en[cur] = time_;
  time_ += 1;
  return;
}







int main(){
  cin >> N;

  for(int i=0;i<101;++i){
    D[i] = -1;//?????????
  }

  for(int i=0;i<N;++i){
    cin >> U;
    cin >> K[U];
    for(int j=0;j<K[U];++j){
      cin >> V;
      G[U][V] = 1;
    }
  }

  for(int j=1;j<=N;++j){
    for(int i=1;i<=N;++i){
      //cout << G[i][j] << " ";
    }
    //cout << endl;
  }

  dfs(1);
  for(int i=2;i<=N;++i){
    if(D[i] == -1)dfs(i);
  }

  for(int i=1;i<=N;++i){
    cout << i << " " << curtime_st[i] << " " << curtime_en[i] << endl; 
  }
}

C++: #include <iostream>

using namespace std;

int graph[101][101]={};
int d[101]={};
int f[101]={};
int n,v,k,time1 = 0,sw[101] = {};


void dfs1(int u){

  sw[u] = 1;
  d[u] = ++time1;

  for(int i = 1; i <= n; i++){
    if( graph[u][i] == 1 && sw[i] == 0 ){
     dfs1(i);
    }

  }
    f[u] = ++time1;
}


int main(){
  int u;
  cin >> n ;
  //グラフをつくる
  for(int i = 0; i < n; i++){
    cin >> u >> k ;
    for(int j = 0; j < k ; j++){
      cin >> v;
      graph[u][v] = 1;
    }
  }
 
 for(int i = 1; i <= n; i++){
    if(sw[i] == 0){
      dfs1(i);
	}
  }

  for(int i = 1; i <= n; i++ ){
    cout << i << ' ' <<  d[i]<< ' ' << f[i] << endl;

  }
}

C++: #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

int t=0;

void dfs(vector<vector<int>> &vec, vector<pair<int, int>> &stmp, int now) {
  if (stmp[now].first) return;
  ++t;
  stmp[now].first = t;

  rep (i, vec[now].size()) dfs(vec, stmp, vec[now][i]);
  

  ++t;
  stmp[now].second = t;
  return;
}
     
int main() {
  int n, k;
  cin >> n;
  vector<vector<int>> vec(n, vector<int>(1));
  vector<pair<int, int>> stmp(n, make_pair(0, 0));
  set<int> s;
  rep (i, n) {
    int voii;
    cin >> voii;
    cin >> k;
    vec[i].resize(k);
    rep (j, k) {
      int x;
      cin >> x;
      vec[i][j] = x - 1;
    }
  }

  rep (i, n) {
    dfs(vec, stmp, i);
  }

  rep (i, n) printf("%d %d %d\n", i + 1, stmp[i].first, stmp[i].second);
}