Go: package main

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

/***************************************************************
stackによる深さ優先探索を実装する。
***************************************************************/

const (
	N     = 100
	WHITE = 0
	GRAY  = 1
	BLACK = 2
)

var (
	n            int
	Adj          [N][N]int
	statusColor  [N]int
	discoverTime [N]int
	finishTime   [N]int
	clock        int
	nt           [N]int
)

/***************************************************************
Stackの定義:
- field
	container: ノードの格納されたスライス
	sp: スタックポインタ
- method
	size(): スタックに積まれているノードの個数を返す
	top(): スタックの一番上に積まれているノードを返す
	isEmpty(): スタックが空かどうかを返す
	pop(): スタックの要素をポップし削除する
	push(): スタックに要素を積む
***************************************************************/

type Stack struct {
	container []int
	sp        int
}

func (s *Stack) size() int {
	return len(s.container)
}

func (s *Stack) top() int {
	return s.container[s.sp]
}

func (s *Stack) isEmpty() bool {
	return s.sp == 0
}

func (s *Stack) pop() int {
	_pop := func() {
		s.container = s.container[:len(s.container)-1]
	}
	defer _pop()
	if s.isEmpty() {
		panic("There is no elements in stack!")
	}
	s.sp--
	return s.container[s.sp]
}

func (s *Stack) push(n int) {
	s.sp++
	s.container[s.sp] = n
}

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

func _DFS(target int) {
	for i := 0; i < n; i++ {
		nt[i] = 0
	}
	stack := new(Stack)
	stack.container = make([]int, N+1)
	stack.push(target)
	statusColor[target] = GRAY
	clock++
	discoverTime[target] = clock
	for !stack.isEmpty() {
		u := stack.top()
		v := next(u)
		if v != -1 {
			if statusColor[v] == WHITE {
				statusColor[v] = GRAY
				clock++
				discoverTime[v] = clock
				stack.push(v)
			}
		} else {
			stack.pop()
			statusColor[u] = BLACK
			clock++
			finishTime[u] = clock
		}
	}
}

func DFS() {
	for i := 0; i < n; i++ {
		statusColor[i] = WHITE
		nt[i] = 0
	}
	clock = 0
	for i := 0; i < n; i++ {
		if statusColor[i] == WHITE {
			_DFS(i)
		}
	}
	for i := 0; i < n; i++ {
		fmt.Printf("%d %d %d\n", i+1, discoverTime[i], finishTime[i])
	}
}

func main() {
	scanner := bufio.NewScanner(os.Stdin)
	scanner.Split(bufio.ScanWords)
	scanner.Scan()
	n, _ = strconv.Atoi(scanner.Text())
	for i := 0; i < n; i++ {
		for j := 0; j < n; j++ {
			Adj[i][j] = 0
		}
	}
	for i := 0; i < n; i++ {
		scanner.Scan()
		u, _ := strconv.Atoi(scanner.Text())
		scanner.Scan()
		k, _ := strconv.Atoi(scanner.Text())
		u--
		for j := 0; j < k; j++ {
			scanner.Scan()
			v, _ := strconv.Atoi(scanner.Text())
			v--
			Adj[u][v] = 1
		}
	}

	DFS()
}

C++: #include<bits/stdc++.h>
#include<string.h>
#define MAX 101
#define WHITE -1
#define GRAY 2
#define BLACK 1
using namespace std;

int G[MAX][MAX]={},d[MAX]={},f[MAX]={},color[MAX]={},times=0,Adj[MAX]={};

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

void visit(int u,int n){
    color[u]=GRAY;
    d[u]=++times;
    int v=1;
    while(v<=n){
        if(G[u][v]>0){
            if(color[v]==WHITE)visit(v,n);
        }
        v++;
    }
    color[u]=BLACK;
    f[u]=++times;
}

void dfs(int V[],int n){
    int u;
    for(u=1;u<=n;u++){
        color[u]=WHITE;
    }
    times =0;
    for(u=1;u<=n;u++){
        if(color[u]==WHITE)visit(u,n);
    }
}

int main(){
  int n,i,k,j,A,B,V[MAX]={};
  cin>>n;
  for(i=0;i<MAX;i++){
    for(j=0;j<MAX;j++){
        G[i][j]=-1;
    }
  }
  for(i=0;i<n;i++){
    cin>>A>>k;
    for(j=0;j<k;j++){
      cin>>B;
      G[A][B]=1;
    }
  }
  dfs(V,n);
  print(n);
}

C++: 
/*
Problem

Category
DFS

URL:
http://judge.u-aizu.ac.jp/onlinejudge/submission.jsp#submit/ALDS1_11_B

考察:


Date: 2020/04/14
*/

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long

/* ==== declarations ====== */
// functions
void solve();
void getInput();

// global variables
int n;
int counter = 1;
vector<vector<int>> ALL;
// vector<int> isVisited;
vector<int> d;
vector<int> f;
vector<int> visited;

/* ======================== */

signed main(){
    getInput();
    solve();
    return 0;
}

void getInput() {
    cin>>n;
    d.resize(n);
    f.resize(n);
    for(int i=0; i<n; ++i) {
        int u, k;
        cin>>u>>k;
        u--;
        vector<int> AL;
        for(int j=0; j<k; ++j) {
            int v;
            cin>>v;
            AL.push_back(--v);
        }
        ALL.push_back(AL);
    }
}

void dfs(int v) {    
    d[v] = counter++;
    visited.push_back(v);
    for(auto u: ALL[v]) {
        if (find(visited.begin(), visited.end(), u) == visited.end()) {
            dfs(u);
        }
    }
    f[v] = counter++;
}


void solve() {
    for(int u=0; u<n; ++u) {
        if (find(visited.begin(), visited.end(), u) == visited.end()) {
            dfs(u);
        }
    }
    for(int i=0; i<n; ++i ) {
        cout<<i+1<<" "<<d[i]<<" "<<f[i]<<endl;
    }
}

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

struct Node{
    bool comp;
    int starttime, endtime;
};

int Time = 1;

void setTime(queue<int> q[], stack<int> t, Node l[]){
    if(Time == 1){
        t.push(1);
        l[0].starttime = Time++;
        setTime(q, t, l);
    }

    if(t.size() == 0){
        return;
    }

    int index = t.top() -1;

    // if(l[index].comp){
    //     cout << index << endl;
    //     t.pop();
    //     setTime(q, t, l);
    // }

    if(q[index].size() == 0){
        t.pop();
        l[index].endtime = Time++;
        l[index].comp = true;
        setTime(q, t, l);
    } else {
        int val = q[index].front();
        q[index].pop();

        if(l[val - 1].comp) setTime(q, t, l);
        else{
            t.push(val);
            l[val - 1].starttime = Time++;
            setTime(q, t, l);
        }
    }

}

int main(){
    int n, v, k, l;
    cin >> n;
    queue<int> q[n];
    stack<int > timetable;
    Node timelist[n];
    for(int i=0; i<n; i++){
        cin >> v >> k;
        v--;
        timelist[i].comp = false;
        for(int j=0; j<k; j++){
            cin >> l;
            q[v].push(l);
        }
    }

    setTime(q, timetable, timelist);

    for(int i=0; i<n; i++){
        cout << i+1 << " " << timelist[i].starttime << " " << timelist[i].endtime << endl;
    }

    return 0;

}

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

#define MAX 100
static const int WHITE = 0; // not visit
static const int GRAY = 1; // visited
static const int BLACK = 2; // searched

int n;
int M[MAX][MAX] = { 0 };
int color[MAX] = { WHITE };
int d[MAX], f[MAX], tt = 0;
int nt[MAX] = { 0 };

// get vertex next u
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 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;
	}
	return;
}

int main() {
	scanf("%d", &n);

	for (int i = 0; i < n; i++) {
		int k, u;
		cin >> u >> k;
		u--;
		for (int j = 0; j < k; j++) {
			int v;
			cin >> v;
			v--;
			M[u][v] = 1;
		}
	}

	dfs();
	return 0;

}