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>
#include <cstring>
using namespace std;
const int INF = 1001001001;

int main() {
    int n;
    cin >> n;
    vector< vector<int> > E(n);
    for(int i=0; i<n; i++) {
        int u,k;
        cin >> u >> k;
        E[u-1].resize(k);
        for(int j=0; j<k; j++) {
            int v;
            cin >> v;
            E[u-1][j] = v-1;
        }
    }
    int c[n];
    int d[n];
    memset(c, 0, sizeof c);
    memset(d,-1,sizeof d);

    c[0] = 1;
    d[0] = 0;
    queue<int> Q;
    Q.push(0);

    while(!(Q.empty())) {
        int u = Q.front();
        Q.pop();
        for(int v : E[u]) {
            if(c[v] == 0) {
                c[v] = 1;
                d[v] = d[u] + 1;
                Q.push(v);
            }
        }
    }
    for(int i=0; i<n; i++) cout << i+1 << " " << d[i] << endl;
    return 0;
}

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

class TNode
{
	int FIndex;
	std::list<TNode*> FTarget;
public:
	TNode(int Index)
	: FIndex(Index)
	{
	}
	
	void Push(TNode* New)
	{
		FTarget.push_back(New);
	}
	
	int Distance(const TNode* Target)const
	{
		if(Target == this) return 0;
		if(std::find(FTarget.begin(), FTarget.end(), Target) != FTarget.end()) return 1;
		int Minimum = -1;
		for(std::list<TNode*>::const_iterator It = FTarget.begin(); It != FTarget.end(); ++It){
			int Distance = (*It)->Distance(Target);
			if(Distance >= 0 && (Minimum > Distance || Minimum < 0)){
				Minimum = Distance;
			}
		}
		return 1 + Minimum;
	}
};

class TGraph
{
	std::vector<TNode*> FNodes;
public:
	TGraph(int Count)
	: FNodes(Count)
	{
		for(int i = 0; i < Count; ++i){
			FNodes[i] = new TNode(i + 1);
		}
	}
	
	~TGraph()
	{
		for(unsigned int i = 0; i < FNodes.size(); ++i){
			delete FNodes[i];
		}
	}
	
	void InputNode()
	{
		int Index;
		std::cin >> Index;
		int BranchCount;
		std::cin >> BranchCount;
		for(int i = 0; i < BranchCount; ++i){
			int Target;
			std::cin >> Target;
			FNodes[Index - 1]->Push(FNodes[Target - 1]);
		}
	}
	
	int MeasureDistance(int Start, int End)const
	{
		return FNodes[Start - 1]->Distance(FNodes[End - 1]);
	}
};

int main()
{
	int Count;
	std::cin >> Count;
	TGraph Graph(Count);
	for(int i = 0; i < Count; ++i){
		Graph.InputNode();
	}

	for(int i = 0; i < Count; ++i){
		std::cout << i + 1 << " " << Graph.MeasureDistance(1, i + 1) << std::endl;
	}
	return 0;
}

C++: #include <stdio.h>
#include <string.h>
#include<iostream>
#include<queue>
using namespace std;

char s[13][1];
int D[106][106];
int A[106],f[106],w,h,n,sx,sy,gx,gy,e,g[106];
int   kensa(int ,int);
int main(){
	queue<int> P;
	int i,j,a,b,c,d;
	for(i=0;i<105;i++){
		for(j=0;j<105;j++){
			D[i][j]=-1;		
		}					
	}						
	for(i=0;i<105;i++){		
		A[i]=0;				
		f[i]=-1;
		g[i]=0;
	}							
	scanf("%d" ,&a);//     a=4
	for(i=1;i<=a;i++){
        scanf("%d",&b);		//
		scanf("%d",&b);			//b=2					//
		for(j=1;j<=b;j++){		//
		scanf("%d",&c);			//					//
		D[i][c]=1;
//
		}						//D[???][???]
	}				
	for(i=1;i<=a;i++){
		for(j=1;j<=a;j++){
	//		printf("%d %d %d\n",i,j,D[i][j]);
		}	
	}//
	P.push(1);
	//P???1
	f[1]=0;
	while(!P.empty()){			//
		d=P.front();
		//
		A[d]=1;
		//
		P.pop();				//
		for(i=1;i<=a;i++){
			//printf("%d %d %d\n",d,i,D[d][i]);//
			if(D[d][i]==-1){		//
			continue;			//
			}					//
			if(A[i]==1){		//
			continue;			//
			}					//
			P.push(i);			//
			
			g[i]=g[d]+1;
			A[i]=1;
			//printf("%d\n",P.back());
		}	
	}							//
	for(i=1;i<=a;i++){			//
	printf("%d %d\n",i, g[i]);	//
	}
	return 0;
}

C++: // clang-format off
#include <bits/stdc++.h>
#define int long long
#define main signed main()
// #define main int main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecision(n)
#define stlice(from, to) substr(from, (to) - (from) + 1)
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
using namespace std;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<char> vc;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<pii> vpii;
typedef vector<vi> vvi;
typedef vector<vb> vvb;
typedef vector<vpii> vvpii;
const int INF = sizeof(int) == sizeof(long long) ? 1000000000000000000LL : 1000000000;
const int MOD = 1000000007;
const double PI = acos(-1);
template<typename A, typename B> bool cmin(A &a, const B &b) { return a > b ? (a = b, true) : false; }
template<typename A, typename B> bool cmax(A &a, const B &b) { return a < b ? (a = b, true) : false; }
bool odd(const int &n) { return n & 1; }
bool even(const int &n) { return !odd(n); }
void solve();
main { solve(); return 0; }
// clang-format on

typedef int Weight;

struct Edge {
  int src, dst;
  Weight weight;
  Edge(int s, int d, Weight w)
    : src(s), dst(d), weight(w) {
  }
};

typedef vector<Edge> Edges;
typedef vector<Edges> Graph;
typedef vector<Weight> Array;
typedef vector<Array> Matrix;

void addEdge(Graph &g, int a, int b, Weight w = 1) {
  g[a].emplace_back(a, b, w);
  g[b].emplace_back(b, a, w);
}

void addArc(Graph &g, int a, int b, Weight w = 1) {
  g[a].emplace_back(a, b, w);
}

void solve() {
  int n;
  cin >> n;
  Graph g(n);
  rep(i, n) {
    int u, k;
    cin >> u >> k;
    u--;
    while (k--) {
      int v;
      cin >> v;
      v--;
      addArc(g, u, v);
    }
  }
  int c = 1;
  vi distance(n, -1);
  vi done(n);
  queue<int> q;
  distance[0] = 0;
  done[0]     = true;
  q.push(0);
  while (q.size()) {
    int x = q.front();
    q.pop();
    for (Edge e : g[x]) {
      if (done[e.dst]) continue;
      done[e.dst]     = true;
      distance[e.dst] = distance[e.src] + 1;
      q.push(e.dst);
    }
  }
  rep(i, n) {
    cout << i + 1 << ' ' << distance[i] << endl;
  }
}

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

const long N = 100;
long M[N + 1][N + 1];
long d[N + 1];
long n;
const long INFTY = 101;

long solve(long id, long dist){
	if (id == 1) d[1] = 0;
	for (long i = 2; i <= n; i++){
		if (M[id][i]){
			if (dist + 1 < d[i]){
				d[i] = dist + 1;
				solve(i, dist + 1);
			} 
		}
	}
}

int main(){
	cin >> n;
	for (long i = 1; i <= n; i++){
		d[i] = INFTY;
		for (long j = 1; j <= n; j++){
			M[i][j] = 0;
		}
	}
	for (long i = 0; i < n; i++){
		long v, k;
		cin >> v >> k;
		for (long j = 0; j < k; j++){
			long nh;
			cin >> nh;
			M[v][nh] = 1;
		}
	}
	solve(1, 0);
	for (long i = 1; i <= n; i++){
		if (d[i] == INFTY) d[i] = -1;
		cout << i << " " << d[i] << endl;
	}
	return 0;
}