Go: package main

import (
	"fmt"
	"os"
	"bufio"
	"strconv"
	"container/list"
)

const MaxNode int = 100

var d []int
var A [][]int
var N int
var l *list.List

func bfs(u int) {
	d[u] = 0
	l.PushBack(u)
	for ;l.Len() != 0; {
		u = l.Front().Value.(int)
		l.Remove(l.Front())
		for v:=0; v<N; v++ {
			if A[u][v] == 0 {
				continue
			}
			if d[v] != -1 {
				continue
			}
			d[v] = d[u] + 1
			l.PushBack(v)
		}
	}
}


func nextInt(scanner *bufio.Scanner) int {
	scanner.Scan()
	num, _ := strconv.Atoi(scanner.Text())
	return num
}

func print() {
	for i:=0; i<N; i++ {
		fmt.Printf("%d %d\n", i+1, d[i])
	}
}

func initVariable() {
	d = make([]int, MaxNode)
	A = make([][]int, MaxNode)
	l = list.New()
	for i:=0; i<MaxNode; i++ {
		A[i] = make([]int, MaxNode)
		d[i] = -1
	}
}


func main() {
	initVariable()
	scanner := bufio.NewScanner(os.Stdin)
	scanner.Split(bufio.ScanWords)
	N = nextInt(scanner)
	for i:=0; i<N; i++ {
		idx := nextInt(scanner)
		cnt := nextInt(scanner)
		for j:=0; j<cnt; j++ {
			node := nextInt(scanner)
			A[idx-1][node-1] = 1 
		}
	}
	bfs(0)
	print()
}

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

const int MAXV = 1010, MAXE = 1000000;

struct edge { int u, v, weight, next; } g[MAXE];


int n;
int head[MAXV], idx;

int parent[MAXV], visited[MAXV], dist[MAXV];

void bfs(int u){
    memset(parent, -1, sizeof(parent));
    memset(visited, 0, sizeof(visited));
    memset(dist, -1, sizeof(dist));
    
    queue<int> q;
    q.push(u);
    visited[u] = 1;
    dist[u] = 0;
    
    while (!q.empty()) {
        int u = q.front();
        q.pop();
        for (int i = head[u]; ~i; i = g[i].next) {
            int v = g[i].v;
            if (!visited[v]) {
                q.push(v);
                visited[v] = 1, parent[v] = u, dist[v] = dist[u] + 1;
            }
        }
    }
}

int main(int argc, char *argv[])
{
    
 
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    idx = 0;
    memset(head, -1, sizeof(head));
    
    cin >> n;
    
    for (int i = 0, u, m, v; i < n; i++) {
        cin >> u >> m;
        for (int j = 0; j < m; j++) {
            cin >> v;
            g[idx] = edge{u, v, 0, head[u]};
            head[u] = idx++;
        }
    }
    
    bfs(1);
    
    for (int i = 1; i <= n; i++) {
        cout << i << " " << dist[i] << endl;
    }
    
    return 0;
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <stdio.h>
#define REP(i, n) for(int i = 0;i < n;i++)

using namespace std;

static const int N = 100;
static const int INFTY = (1 << 21);

int n, M[N][N];
int d[N];

void bfs(int s)
{
	queue<int>	q;
	q.push(s);
	REP(i, n)
		d[i] = INFTY;
	d[s] = 0;
	int u;

	while (!q.empty())
	{
		u = q.front();
		q.pop();
		REP(v, n)
		{
			if (M[u][v] == 0)
				continue;
			if (d[v] != INFTY)
				continue;
			d[v] = d[u] + 1;
			q.push(v);
		}
	}
	REP(i, n)
		cout << i + 1 << " " << ((d[i] == INFTY) ? (-1) : d[i]) << endl;
}

int main()
{
	int u, k, v;

	cin >> n;

	REP(i, n)
	{
		REP(j, n)
			M[n][n] = 0;
	}

	REP(i, n)
	{
		cin >> u >> k;
		u--;
		REP(j, k)
		{
			cin >> v;
			v--;
			M[u][v] = 1;
		}
	}

	REP(i, n)
	{
		REP(j, n)
		{
			cout << M[i][j];
		}
		cout << endl;
	}

	bfs(0);
	return 0;
}

C++: #include <iostream>
#include <vector>

int main() {
	int n;
	std::cin >> n;
	std::vector<int> d(n, -1);
	std::vector<int> dtmp(n, -1);
	std::vector<std::vector<int>> vec(n);
	for (int i = 0; i < n; i++) {
		int u, k;
		std::cin >> u >> k;
		while (k--) {
			int a;
			std::cin >> a;
			vec[i].push_back(a - 1);
		}
	}

	dtmp[0] = 0;
	for (int i = 0; i < n; i++) {
		d = dtmp;
		for (int idx = 0; idx < n; idx++) {
			if (d[idx] >= 0) {
				for (int j = 0; j < vec[idx].size(); j++) {
					if (dtmp[vec[idx][j]] == -1) {
						dtmp[vec[idx][j]] = i + 1;
					}
				}
			}
		}
	}

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

C++: #include <bits/stdc++.h>
#define MOD 1000000007
#define INF 1<<30
#define rep(i,n) for(ll i=0; i<(n); i++)
#define REP(i,a,b) for(ll i=(a); i<(b); i++)
#define RREP(i,a,b) for(ll i=(a); i>=(b); i--)
#define all(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;
typedef int64_t in;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<string> vs;
typedef pair<ll, ll> p;
typedef vector<pair<ll, ll>> vpl;

vvl m(105, vl(105,0));
vl d(105, INF);
ll n;

void bfs(ll s){
    queue<ll> q;
    q.push(s);
    d[s] = 0;
    ll u;
    while(!q.empty()){
        u = q.front(); q.pop();
        rep(v,n){
            if(m[u][v] == 1){
                if(d[v] == INF){
                    d[v] = d[u] + 1;
                    q.push(v);
                }
            }
        }
    }
    rep(i,n){
        if(d[i] != INF) cout << i+1 << " " << d[i] << endl; 
        else cout << i+1 << " " << -1 << endl;
    }
}

int main(){
    ll u,k,v;
    cin >> n;
    rep(i,n){
        cin >> u >> k;
        rep(j,k){
            cin >> v;
            m[u-1][v-1] = 1;
        }
    }
    bfs(0);
    
    return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<vector>
#include<queue>

using namespace std;

int main(){
   int n,u,v,k,inf = -1;
   cin >> n;
   vector<int> a(n,0),D(n,inf);
   vector<vector<int> > edges(n,a); 
   for(int i = 0;i < n;i++){
       cin >> u;
       cin >> v;
       for(int ii = 0;ii < v;ii++){
           cin >> k;
           edges[u-1][k-1] = 1;
       }
   }
   queue<int> Q;
   Q.push(0);
   D[0] = 0;
   while(!Q.empty()){
        int cur = Q.front();
        Q.pop();//最初の要素を削除、詰める
        for(int dst = 0;dst < n;dst++){
            if(edges[cur][dst] == 1 && D[dst] == inf){
                D[dst] = D[cur] + 1;
                Q.push(dst);
            }
        }
   }
   for(int i = 0;i < n;i++){
       cout << i+1 << " " << D[i] << endl;
   }
}

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

queue<pair<int,int> > qu;
vector<int> v[111];
int root;
int b[111];
int d[111];
pair<int, int> pa;
int g;

void wide(int num){

  memset(d,-1,sizeof(d));
  d[num] = 0;
  qu.push(make_pair(num,d[1]));

  while(!qu.empty()){

    qu.front();
    pa = qu.front();
    qu.pop();
    int id = pa.first;

    for(int i = 0; i < (int)v[id].size(); i++){
      if(d[v[id][i]] == -1){
	d[v[id][i]] = pa.second + 1;
	qu.push(make_pair(v[id][i],d[v[id][i]]));
      }
    }
  }
  for(int i = 1; i <= g; i++){
    cout << i << " " << d[i] << endl;
  }

}

int main(){

 
  cin >> g;
  int n;
  for(int i = 0; i < g; i++){
    cin >> n >> b[i];
    for(int j = 0; j < b[i]; j++){
      cin >> root;
      v[n].push_back(root);
      v[root].push_back(n);
    }
  }

  wide(1);

}

C++: #include <iostream>
#include <climits>
#include <queue>

static const int N=100;

int n,M[N][N];
int d[N];

using namespace std;
void bfs(int s)
{
    queue<int> q;
    q.push(s);
    for(int i=0;i<n;i++) d[i]=INT_MAX;
    d[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(d[v]!=INT_MAX) continue;
            d[v]=d[u]+1;
            q.push(v);
         }
    }
    for(int i=0;i<n;i++)
    {
        cout<<i+1<<" "<<((d[i]==INT_MAX)?(-1):d[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);
    return 0;
}