Go: package main

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

type Queue []int

func (q *Queue) push(v int) {
	*q = append(*q, v)
}

func (q *Queue) pop() int {
	v := (*q)[0]
	*q = (*q)[1:]
	return v
}

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

	nVerts := scanInt(sc)
	graph := make([][]int, nVerts+1)

	for i := 0; i < nVerts; i++ {
		u := scanInt(sc)
		nDegrees := scanInt(sc)

		graph[u] = make([]int, nDegrees)
		for d := 0; d < nDegrees; d++ {
			graph[u][d] = scanInt(sc)
		}
	}

	paths := make([]int, nVerts+1)

	queue := Queue(make([]int, 0))
	queue.push(1)
	paths[1] = 1

	for len(queue) > 0 {
		u := queue.pop()
		d := paths[u] + 1
		for _, v := range graph[u] {
			if paths[v] == 0 {
				paths[v] = d
				queue.push(v)
			}
		}
	}

	w := bufio.NewWriter(os.Stdout)
	for i := 1; i <= nVerts; i++ {
		fmt.Fprintf(w, "%d %d\n", i, paths[i]-1)
	}
	w.Flush()
}

func scanInt(sc *bufio.Scanner) int {
	sc.Scan()
	v, _ := strconv.Atoi(sc.Text())
	return v
}

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

static const int N = 100;
static const unsigned int INF = (1 << 31);

int n,m[N][N];
int dist[N];

void bfs(int s){
    queue<int> q;
    q.push(s);
    for(int i=0;i<n;i++) dist[i] = INF;
    dist[s] = 0;
    int u;
    while(!q.empty()){
        u = q.front();
        q.pop();
        for(int v=0;v<n;v++){
            if(m[u][v] == 0)   continue;
            if(dist[v] != INF) continue;
            dist[v] = dist[u]+1;
            q.push(v);
        }
    }
    for(int i=0;i<n;i++){
        cout << i+1 << ' ' << ((dist[i] == INF) ? -1 : dist[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;
        }
    }

    bfs(0);
}

C++: #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for(int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
const long long INFLL = 1LL << 60;
const int INFINT = 1 << 30;
const long long MOD = 1e9 + 7;

vector<vector<int>> G(101, vector<int>(0));
vector<int> c(101, 0);
vector<int> d(101, 0);
vector<int> f(101, 0);

template <class T> void vecout(T V) {
    auto t = V.begin();
    *t++;
    while(t != V.end()) {
        cout << " " << *t++;
        // if(t != V.end()) cout << " ";
    }
    cout << endl;
};

int t = 0;
void dfs(int i) {
    if(c[i]) return;
    c[i] = 1;
    d[i] = ++t;
    for(auto e : G[i])
        dfs(e);
    f[i] = ++t;
}

class node {
  public:
    int dist = -1;
    vector<int> nex;
};

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n, u, k, a;
    cin >> n;
    vector<node> Node(n + 1);
    queue<int> Q;
    rep(i, n) {
        cin >> u >> k;
        rep(j, k) {
            cin >> a;
            Node.at(u).nex.push_back(a);
        }
    }
    Node[1].dist = 0;
    Q.push(1);

    while(!Q.empty()) {
        int v = Q.front();
        Q.pop();
        for(auto e : Node[v].nex) {
            if(Node[e].dist > -1) continue;
            Node[e].dist = Node[v].dist + 1;
            Q.push(e);
        }
    }

    rep(i, 1, n + 1) cout << i << " " << Node[i].dist << "\n";
}

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

const int nIMPOS = -1;
struct StDist
{
  int m_nDist;
  int m_nDmy;

  StDist(int nDist) : m_nDist(nDist), m_nDmy(0)
  { }
};

void fnInput(vector<vector<int>>& rvvnAdjcy, vector<StDist>& rvoDist)
{
  int nxSiz;
  cin >> nxSiz;

  rvvnAdjcy.resize(nxSiz + 1, vector<int>(nxSiz + 1, 0));
  for (int i = 0; i < nxSiz; ++i)
  {
    int nx, nySiz;
    cin >> nx >> nySiz;
    for (int j = 0; j < nySiz; ++j)
    {
      int ny;
      cin >> ny;
      rvvnAdjcy[nx][ny] = 1;
    }
  }
  StDist oDist(nIMPOS);
  rvoDist.resize(nxSiz + 1, oDist);
}

void fnBreadthFirstSearch(const vector<vector<int>>& cnrvvnAdjcy, 
                          queue<int>& rqnBFSrch, vector<StDist>& rvoDist)
{
  while (rqnBFSrch.size())
  {
    int nx = rqnBFSrch.front(); rqnBFSrch.pop();

    for (int ny = 1; ny < cnrvvnAdjcy[nx].size(); ++ny)
    {
      if (!cnrvvnAdjcy[nx][ny])          continue;
      if (rvoDist[ny].m_nDist != nIMPOS) continue; 

      int nDist = rvoDist[nx].m_nDist + 1;
      rvoDist[ny].m_nDist = nDist;
      rqnBFSrch.push(ny);
    }
  }
}

void fnResult(const vector<StDist>& cnrvoDist)
{
  for (int i = 1; i < cnrvoDist.size(); ++i)
    cout << i <<  " " << cnrvoDist[i].m_nDist << endl;
}

int main()
{
  cin.tie(0);
  ios::sync_with_stdio(false);
  vector<vector<int>> vvnAdjcy;
  queue<int>  qnBFSrch;
  vector<StDist> voDist;

  fnInput(vvnAdjcy, voDist);

  voDist[1].m_nDist = 0;
  qnBFSrch.push(1);
  fnBreadthFirstSearch(vvnAdjcy, qnBFSrch, voDist);
  fnResult(voDist);

  return 0;
}

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

int t[110];	
vector<int> a[110];

void deep(int n,int time) {
	time++;
	for (int i = 0; i < a[n].size(); i++) {
		if (t[a[n][i]] >time) {
			t[a[n][i]] = time;
			deep(a[n][i],time);
		}
		else if (t[a[n][i]] == -1) {
			t[a[n][i]] = time;
			deep(a[n][i], time);
		}
	}
}


int main() {
	ios::sync_with_stdio(false); cin.tie(0);
	
	int N; cin >> N;
	int u, k, v;
	fill(t, t + 110, -1);
	t[1] = 0;
	for (int i = 0; i < N; i++) {
		cin >> u >> k;
		for (int j = 0; j < k; j++) {
			cin >> v;
			a[u].push_back(v);
		}
	}
	deep(1, 0);
	for (int i = 1; i <= N; i++) {
		cout << i << " " << t[i] << endl;
	}
}

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

#define N 100
#define INFTY 1000000

int M[N][N],d[N];
int i,j,n,u,k,v;

void bfs(int s){

  queue <int> Q;

  for( i = 0; i < N; i++ ) d[i] = INFTY;
  

  d[s] = 0;
  Q.push(s);
    
  while ( !Q.empty() ){
    u = Q.front(); Q.pop();
    for( int v = 0; v < n; v++ ){
      if( M[u][v] == 0 ) continue;
      if( d[v] != INFTY ) continue;
	d[v] = d[u] + 1;
	Q.push(v);
      }
    }

  
  for( i = 0; i < n; i++ ){
    cout << i+1 << " ";
    if ( d[i] == INFTY ) cout << -1;
    else cout << d[i];
    cout << endl;
  }

}


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

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

int main(){
  queue<int> q;
  int n,k,u,max=0;
  int g[101]={},f[101];
  int d[101][101]={};
  int di;
  cin>>n;
  for(int i=0;i<101;i++) f[i]=-1;
  f[1]=0;
  g[1]=1;
  for(int i=0;i<n;i++){
    cin>>u>>k;
    if(max<k) max=k;
    for(int j=0;j<k;j++){
      cin>>di;
      if(g[di]==0){
	g[di]=1;
	d[u][j]=di;
      }
    }
  }

  q.push(1);

  int cnt=1,fg;
  int a,c[101]={};
  while(!q.empty()){
    fg=0;
 a=q.front();
    for(int i=0;i<=max;i++){

      if( d[a][i]>0){
	fg=1;
	q.push(d[a][i]);
	f[d[a][i]]=c[a]+1;
	c[d[a][i]]=c[a]+1;
      }
    }
      q.pop();
    if(fg==1) cnt++;
  }
  for(int i=1;i<=n;i++) cout<<i<<" "<<f[i]<<endl;
  return 0;
}

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

int n;
int a[100][100] = {0};
int k[100] = {0};
int d[100];

int kansu( int i, int t ){
	if ( d[i] != -1 && d[i] <= t ) return 0;
	d[i] = t;
	t++;
	for ( int j = 0; j < k[i]; j++ ) {
		kansu( a[i][j], t );
	}
	return 0;
}

int main(){
	cin >> n;
	int s;
	for ( int i = 0; i < n; i++ ) {
		cin >> s;
		cin >> k[i];
		for ( int j = 0; j < k[i]; j++ ) {
			cin >> s;
			a[i][j] = s-1;
		}
	}
	for ( int i = 0; i < n; i++ ) {
		d[i] = -1;
	}
	kansu(0,0);
	for ( int i = 0; i < n; i++ ) {
		cout << i+1 << " " << d[i] << endl;
	}
	return 0;
}