Go: package main

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

type Pair struct {
	v int
	d int
}

type Queue []Pair

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

func (q *Queue) pop() Pair {
	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([]Pair, 0))
	queue.push(Pair{1, 1})
	paths[1] = 1

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

	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 <iostream>
#include <vector>
#include <queue>
using namespace  std;

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

  StDist(int nDist) : m_nDist(nDist), m_nFromMeTo(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();
    if (rvoDist[nx].m_nDist == nIMPOS)  continue;
    if (rvoDist[nx].m_nFromMeTo == 1 )  continue; 

    rvoDist[nx].m_nFromMeTo = 1;
    for (int ny = 1; ny < cnrvvnAdjcy[nx].size(); ++ny)
      if (cnrvvnAdjcy[nx][ny] == 1)
      {
        int nDist = rvoDist[nx].m_nDist + 1;
        if (rvoDist[ny].m_nDist == nIMPOS)
          rvoDist[ny].m_nDist = nDist;
        else
          rvoDist[ny].m_nDist = min(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<iostream>
#include<cstdio>
#include<queue>
#define Lens 105
using namespace std;
int N;
int A[Lens][Lens];
int d[Lens];
char c[Lens];
queue<int> Q;

int main()
{
	cin >> N;
	for (int i = 1; i <= N; i++)
	{
		int k, n;
		cin >> k >> n;
		c[k] = 'w';
		for (int i = 0; i < n; i++)
		{
			int j;
			cin >> j;
			Q.push(j);
			A[k][j] = 1;
		}
	}
	int j = Q.front();
	for (int i = 1; i <= N; i++)
	{
		while (A[i][j] == 1 && c[j] == 'w')
		{
			Q.pop();
			d[j] = d[i] + 1;
			c[j] = 'g';
			if (Q.size() == 0)
				break;
			j = Q.front();
			while (c[j] == 'g')
			{
				Q.pop();
				if (Q.size() == 0)
					break;
				j = Q.front();
			}

		}

	}
	for (int i = 1; i <= N; i++)
	{
		cout << i << ' ' << d[i] << endl;
	}
	return 0;
}

C++: #include<bits/stdc++.h>

using namespace std;

vector<int> G[110];

const int INF=1e9;

int d[110];
bool used[110];

void bfs(int x)
{
    fill(d,d+110,INF);
    d[x]=0;

    queue<pair<int,int> > q;

    q.push(make_pair(0,x));

    used[x]=true;

    while(!q.empty())
    {
        pair<int,int> tmp=q.front();q.pop();

        int dd=tmp.first,now=tmp.second;
        for(int i=0;i<G[now].size();i++)
        {
            if(!used[G[now][i]])
            {
                d[G[now][i]]=dd+1;
                q.push(make_pair(dd+1,G[now][i]));
                used[G[now][i]]=true;
            }
        }
    }
}


int main()
{
    int n;

    cin>>n;

    for(int i=0;i<n;i++)
    {
        int a,b,c;

        cin>>a>>b;

        for(int j=0;j<b;j++)
        {
            cin>>c;

            G[a].push_back(c);
        }
    }

    bfs(1);

    for(int i=1;i<=n;i++)
    {
        cout<<i<<" ";

        if(d[i]==INF)
        {
            cout<<"-1";
        }else
        {
            cout<<d[i];
        }
        cout<<endl;
    }

    return 0;
}

C++: /**
 * Bredth first search.
 */

#include <iostream>
using namespace std;
const int N = 101;
int adj[N][N] = {0};
int d[N]={-1};

void bfs(int n, int dd) {
	int k = adj[n][0];
	d[n] = dd++;
	for (int j=1;j<=k;j++) {
		bfs(adj[n][j], dd);
	}
}

int main()
{
	int n;
	cin >> n;
	for (int i=1;i<=n;i++){
		int j, k;
		cin >> j >> k;
		adj[j][0]=k;
		for (int m=1;m<=k;m++) {
			int a;
			cin >> a;
			adj[j][m]=a;
		}
	}

	bfs(1, 0);

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

	return 0;
}

C++: #include<stdio.h>
struct
{
    int Q[10000];
    int head=0,last=0;
    void push_Back(int x)
    {
        Q[last]=x;
        last=(last+1)%10000;
    }
    int pop()
    {
        int x=Q[head];
        head=(head+1)%10000;
        return x;
    }
    bool Empty()
    {
     return head==last;
    }
}myqueue;
const int N=100;
const int nil=10000000;
int n;
int tu[N][N];
int juli[N];
void BFS()
{
    for (int i=0;i<n;i++)
        juli[i]=nil;
  myqueue.push_Back(0);
  juli[0]=0;
  int u;
  while(!myqueue.Empty())
  {
      u=myqueue.pop();
      for (int v=0;v<n;v++)
      {
          if(tu[u][v]==0) continue;
          if(juli[v]!=nil) continue;
          juli[v]=juli[u]+1;
          myqueue.push_Back(v);
      }
  }
  for (int i=0;i<n;i++)
  {
      printf("%d %d\n",i+1,((juli[i]==nil)?(-1):juli[i]));
  }
}
int main()
{
    int u,v,k;
    scanf("%d",&n);
    for (int i=0;i<n;i++)
    {
        scanf("%d%d",&u,&k);
        u--;
        for (int j=0;j<k;j++)
        {
            scanf("%d",&v);
            v--;
            tu[u][v]=1;
        }
    }
    BFS();
    return 0;
}

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

using namespace std;

static const int MAX=100;
static const int INF =(1<<21);

int n,BY[MAX][MAX];
int dist[MAX];//距離で訪問状態を管理する

void bfs(int);

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

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

    return 0;
}
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(BY[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;
    }
}