Go: package main

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

type TimeRecord struct {
	discoverTime int
	finishTime   int
}

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

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

	timeRecordMap := make([]TimeRecord, n)
	childrenMap := make([][]int, n)
	for i := 1; i <= n; i++ {
		node, err := nextInt(sc)
		if err != nil {
			panic(err)
		}
		timeRecordMap[node-1] = TimeRecord{-1, -1}

		childNum, err := nextInt(sc)
		if err != nil {
			panic(err)
		}
		childrenMap[node-1] = make([]int, childNum)
		for j := 0; j < childNum; j++ {
			child, err := nextInt(sc)
			if err != nil {
				panic(err)
			}
			childrenMap[node-1][j] = child
		}
	}

	timer := 1
	startNode := 1
	for {
		visit(startNode, &timer, childrenMap, timeRecordMap)
		startNode = findStartNode(childrenMap, timeRecordMap)
		if startNode < 0 {
			break
		}
	}
	for k, v := range timeRecordMap {
		fmt.Printf("%d %d %d\n", k+1, v.discoverTime, v.finishTime)
	}
}

func findStartNode(childrenMap [][]int, timeRecordMap []TimeRecord) int {
	x := -1
	for node, timeRecord := range timeRecordMap {
		if timeRecord.discoverTime < 0 {
			x = node + 1
			break
		}
	}
	return x
}

func visit(currentNode int, timer *int, childrenMap [][]int, timeRecordMap []TimeRecord) {
	if timeRecordMap[currentNode-1].discoverTime > 0 {
		return
	}
	children := childrenMap[currentNode-1]
	timeRecordMap[currentNode-1] = TimeRecord{*timer, timeRecordMap[currentNode-1].finishTime}
	(*timer)++
	for i := 0; i < len(children); i++ {
		visit(children[i], timer, childrenMap, timeRecordMap)
	}
	timeRecordMap[currentNode-1] = TimeRecord{timeRecordMap[currentNode-1].discoverTime, *timer}
	(*timer)++
}

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

C++: #include<stdio.h>

void depthfs(void);

void visit(int);

#define MAX 109

#define WHITE 0
#define GRAY 1
#define BLACK 2

int graph[MAX][MAX];

int n;
int time;
int d[MAX],f[MAX];
int color[MAX];

int main(){
  int num,i;
  int u,j,v;

  scanf("%d",&n);

  for(i=1;i<=n;i++){
    for(j=1;j<=n;j++){    
      graph[i][j] = 0;
    }
  }

  for(i=1;i<=n;i++){
    scanf("%d%d",&u,&num);
    for(j=0;j<num;j++){
      scanf("%d",&v);
      graph[u][v] = 1;
    }
  }

  depthfs();

  for(i=1;i<=n;i++){
    printf("%d %d %d\n",i,d[i],f[i]);
  }

  
  return 0;

}

void depthfs(void){
  int i;
  //for each vertex u in V
  for(i=1;i<=n;i++){
  color[i] = WHITE;
  d[i] = 0;
  f[i] = 0;
  }

  time= 0;

  //for each vertex u in V
  for(i=1;i<=n;i++){
  if(color[i] == WHITE) visit(i);
  }

}

void visit(int x){
  int i;

  color[x] = GRAY;//white vertex u has just been discovered

  d[x] = ++time;

  //for each v in adj[u] //explore edge(u,v)

  for(i=1;i<=n;i++){
    if(graph[x][i] == 1){
      if(color[i] == WHITE) visit(i);
    }
  }

  color[x] = BLACK; //blacken u; it is finished

  f[x] = ++time;
  
}

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

int m[101][101];
int visit[101];
int d[101];
int f[101];
int n, t;

void dfs(int u){
  visit[u] = 1;
  d[u] = t;
  t++;
  
  for(int i = 0; i < n; ++i){
    if(m[u][i] == 1 && visit[i] == 0){
      dfs(i);
    }
  }

  f[u] = t;
  t++;
}

main()
{
  int u, k, v;
  
  cin >> n;
  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;
    }
  }

  for(int i = 0; i < n; ++i){
    if(visit[i]==0){
      dfs(i);
    }
  }

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

  return (0);
}

C++: #include <iostream>

using namespace std;

int V[100][100];
int n;

int d[100];
int f[100];

int t = 1;
void dfs(int src){
  t++;
  for(int i=1;i<=n;i++){
    if(V[src][i] != 0 && !d[i]){
      d[i] = t;
      dfs(i);
      t++;
    }
  }
  f[src] = t;
}
int main(){
  int  src, dst, num;
  cin >> n;
  for(int i=1;i<=n;i++){
    d[i] = 0; f[i] = 0;
  }
  for(int i=1;i<=n;i++){
    cin >> src >> num;
    for(int j=0;j<num;j++){
      cin >> dst;
      V[src][dst] = 1;
    }
  }
  d[1] = 1;
  dfs(1);
  for(int i=1;i<=n;i++){
    cout << i <<" "<< d[i] <<" "<< f[i] << endl;
  }
  return 0;
}

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

int n;
int common_time=1;
int g[110][110];
int d[10000];
int f[10000];

int dfs(int node){
  if(d[node]==0){
    d[node]=common_time++;
    //cout<<node<<" "<<d[node]<<"#"<<endl;
  }
  else{
    return 0;
  }
  for(int i=0;i<=n;i++){
    if(g[node][i] == 1){
      //cout<<node<<"$"<<i<<endl;
			dfs(i);
    }
  }
	f[node] = common_time++;
  //cout<<node<<" "<<f[node]<<"&"<<endl;
}

int main(){

  cin>>n;

  for(int i=0;i<n;i++){
    for (int j=0;j<n;j++){
      g[i][j]=0;
    }
  }

  for(int i=0;i<10000;i++){
    d[i]=0;
    f[i]=0;
  }
  int u;
  int k;
  int v;
  for(int i=0;i<n;i++){
    cin >>u;
    cin>>k;
    for(int j=0;j<k;j++){
      cin>>v;
      v--;
      g[u-1][v]=1;
      //g[v][u-1]=1;
    }
  }
  
  for(int i=0;i<n;i++){
    for(int j=0;j<n;j++){
      //cout<<g[i][j];
    }
    //cout<<endl;
  }
  
 for(int i=0;i<n;i++){
  dfs(i);
 }
  
  for(int i=0;i<n;i++){
    cout<<i+1<<" "<<d[i]<<" "<<f[i]<<endl;
  }
  return 0;
}

C++: #include <iostream>
using namespace std;
int G[101][101];
int d[101];
int f[101];
bool flag[101];
int n,v,k,p;
int t;

void check(int i){
	if(flag[i])return;
	flag[i]=true;
	t++;
	d[i]=t;
	for(int j=1;j<=n;j++){
		if(G[i][j]==1)check(j);
	}
	t++;
	f[i]=t;
	return;
}


int main(){
	cin >>n;
	for(int i=0;i<n;i++){
		cin >> v>>k;
		for(int j=0;j<k;j++){
			cin >> p;
			G[v][p]=1;
		}
	}
	t=0;
	check(1);
	for(int i=1;i<=n;i++){
		cout << i<< " "<<d[i]<< " "<<f[i] <<endl;
	}
}

C++: #include<iostream>
using namespace std;
struct T{int first,last;};
struct T ttt[200];
int n,ch[200],u,V[200][200],ti=1,a;
bool Discovery[200];
void search(int p){
    ttt[p].first=ti;ti++;
    int x;
    Discovery[p]=true;
    for(int i=1;i<=ch[p];i++){
        x=V[p][i];
        if(!Discovery[x]) search(x);
    }
    ttt[p].last=ti; ti++;
}
int main(){
    cin>>n;
    for(int i=1;i<=n;i++){
        cin>>a>>ch[i];
        Discovery[i]=false;
        for(int j=1;j<=ch[i];j++){
            cin>>V[i][j];
        }
    }
    for(int i=1;i<=n;i++){
        if(!Discovery[i]) search(i);
    }
    for(int i=1;i<=n;i++){
        cout<<i<<" "<<ttt[i].first<<" "<<ttt[i].last<<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, tt;
int color[N], nt[N], M[N][N], d[N], f[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[v] = BLACK;
	    	f[u] == ++tt; 
	    }
	} 
}


void dfs() {
   for(int i = 0; i < n; i++) {
   	   color[i] = WHITE;
       nt[i] = 0; 
   }
   tt = 0;
   
   for(int i = 0; i < n; i++) {
   	   if(color[i] = WHITE) {
   	   	   dfs_visit(i);
   	   }
   }
   
   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[i][j] = 1;
		}
	}
	
    dfs();
    
    return 0;
	
}