Go: package main

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

var distance []int

type queue struct {
	q    []int
	head int
	tail int
}

func (q *queue) push(n int) {
	q.q[q.tail] = n
	q.tail++
}

func (q *queue) pop() int {
	q.head++
	return q.q[q.head-1]
}

func (q *queue) isEmpty() bool {
	return q.head == q.tail
}

func makeAdjList() [][]int {
	var n int
	fmt.Scanf("%d", &n)

	adj := make([][]int, n)
	for i := 0; i < n; i++ {
		adj[i] = make([]int, n)
	}

	sc := bufio.NewScanner(os.Stdin)
	for i := 0; i < n; i++ {
		sc.Scan()
		nodeInfo := strings.Split(sc.Text(), " ")
		outDegree, _ := strconv.Atoi(nodeInfo[1])

		if outDegree > 0 {
			for k := 0; k < outDegree; k++ {
				j, _ := strconv.Atoi(nodeInfo[k+2])
				j-- // convert 1 based to 0 based
				adj[i][j] = 1
			}
		}
	}

	return adj
}

func bfs(graph [][]int, s int) {
	distance = make([]int, len(graph))

	infty := -1
	for i := 0; i < len(distance); i++ {
		distance[i] = infty
	}
	distance[s] = 0

	q := &queue{make([]int, 1000), 0, 0}
	q.push(s)

	for !q.isEmpty() {
		u := q.pop()
		for i := 0; i < len(graph); i++ {
			if graph[u][i] == 0 {
				continue // u, i間に辺がない場合
			}
			if distance[i] != infty {
				continue // 訪問済みの場合
			}
			// 訪問するnodeの始点からの距離を設定し、訪問キューに入れる
			distance[i] = distance[u] + 1
			q.push(i)
		}
	}

	// print distance
	for i, d := range distance {
		fmt.Printf("%d %d\n", i+1, d)
	}
}

func main() {
	adj := makeAdjList()
	bfs(adj, 0)
}

C++: #include<iostream>
#include<cstdio>
#define INF 1<<30
#define MAX 100000
using namespace std;
 
class Queue{
private:
  int inf[MAX];
  int head,tail;
  
public:
  
  Queue(){
    syokika();
  }
  
  void syokika(){
    head = 0;
    tail = 0;
  }
  
  void push(int x){
    inf[tail]=x;
    if(MAX == tail+1)tail = 0;
    else tail++;
  }
  
  void pop(){
    if(MAX == head+1)head=0;
    else head++;
  }
  
  int front(){
    return inf[head];
  }
  
  bool empty(){
    if(tail - head == 0)return true;
    else return false;
  }
  
  int size(){
    return tail - head;
  }
  
};
 
int imap[200][200];
int k[200] = {0};
int ans[200] = {0};
bool used[200];
 
int main(){
  int n,u[1000];
  cin >> n;
  for(int i=0;i<200;i++)for(int j=0;j<200;j++)imap[j][i] = INF; 
  for(int i=0;i<n;i++){
    cin >> u[i];
    cin >> k[u[i]];
    for(int j=0;j<k[u[i]];j++){
      cin >> imap[u[i]][j];
    }
  }
 
   int h;
  for(int i=0;i<n;i++){
    int Min = i;
    for(int j=i;j<n;j++){
      if(u[Min] > u[j])Min = j;
    }
    h = u[Min];
    u[Min] = u[i];
    u[i] = h;
  }
 
  Queue que = Queue();
 
  que.push(u[0]);
 
  while(!que.empty()){
    int p = que.front(); que.pop();
    for(int i=0;i<k[p];i++){
      if(!used[imap[p][i]]){
    que.push(imap[p][i]);//cout << "push!= " << imap[p][i] << endl;
    used[imap[p][i]] = true;
    ans[imap[p][i]] = ans[p] + 1;
      }
    }
  }
  //for(int i=0;i<n;i++)cout << u[i] << endl;
  
  for(int i=0;i<n;i++){
    cout << u[i]-1 << " " << ans[u[i]] << endl;
  }
 
  return 0;
}

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

//breadth first search

int main() {
	int n, u, k, v;
	vector< vector< int > > list;
	vector< int > dist;
	queue< int > que;
	
	cin >> n;
	list.resize(n);
	dist.resize(n);
	
	for(int i=0;i<n;++i){
		cin >> u >> k;
		dist[i] = -1;
		
		for(int j=0;j<k;++j){
			cin >> v;
			list[u-1].push_back(v-1);
		}
	}
	
	que.push(0);
	dist[0] = 0;
	
	while(!que.empty()){
		int cur = que.front();
		vector< int > branch = list[cur];
		que.pop();
		
		for(vector< int >::iterator it=branch.begin();it<branch.end();++it){
			if(dist[*it] == -1){
				que.push(*it);
				dist[*it] = dist[cur] + 1;
			}
		}
	}
	
	for(int i=0;i<n;++i){
		cout << i+1 << " " << dist[i] << endl;
	}
	
	return 0;
}

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

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);
  for ( int i = 0; i < n; i++ ) d[i] = INFTY;
  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] != INFTY ) continue;
      d[v] = d[u] + 1;
      q.push(v);
    }
  }
  for ( int i = 0; i < n; i++ ) {
    cout << i+1 << " " << ( (d[i] == INFTY) ? (-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;
}

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;
}