Go: package main

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

//util
var sc = bufio.NewScanner(os.Stdin)

func nextStr() string {
	sc.Scan()
	return sc.Text()
}

func nextInt() int {
	sc.Scan()
	i, e := strconv.Atoi(sc.Text())
	if e != nil {
		panic(e)
	}
	return i
}

func printList(list []int) {
	n := len(list)
	buf := bufio.NewWriter(os.Stdout)
	for _, v := range list[0 : n-1] {
		buf.Write([]byte(fmt.Sprintf("%d ", v)))
	}
	buf.Write([]byte(fmt.Sprintf("%d\n", list[n-1])))
	buf.Flush()
}

func max(a, b int) int {
	if a > b {
		return a
	} else {
		return b
	}
}

func min(a, b int) int {
	if a > b {
		return b
	} else {
		return a
	}
}

//solve
const (
	MAX = 100000
	NIL = -1
)

var (
	n, m, q, s, t int
	G             [MAX][]int //連結リスト
	color         [MAX]int
)

func dfs(r int, c int) {
	S := list.New()
	S.PushFront(r)
	color[r] = c
	for S.Len() != 0 {
		u := S.Remove(S.Front()).(int)
		for i := 0; i < len(G[u]); i++ {
			v := G[u][i]
			if color[v] == NIL {
				color[v] = c
				S.PushFront(v)
			}
		}
	}
}

//幅優先探索で、頂点を色付け
func assignColor() {
	id := 1
	for i := 0; i < n; i++ {
		color[i] = NIL
	}
	for i := 0; i < n; i++ {
		if color[i] == NIL {
			id++
			dfs(i, id)
		}
	}
}

func main() {
	sc.Split(bufio.ScanWords)
	n, m = nextInt(), nextInt()
	for i := 0; i < m; i++ {
		s, t = nextInt(), nextInt()
		if i == 0 {
			G[s] = make([]int, 0)
			G[t] = make([]int, 0)
		}
		G[s] = append(G[s], t)
		G[t] = append(G[t], s)

	}
	assignColor()
	q = nextInt()
	for i := 0; i < q; i++ {
		s, t = nextInt(), nextInt()
		if color[s] == color[t] {
			fmt.Println("yes")
		} else {
			fmt.Println("no")
		}
	}

}

C++: #include <iostream>
#include <vector>
#include <stack>
using namespace std;
static const int MAX = 100000;
static const int NIL = -1;

int n;
vector<int> G[MAX];
int color[MAX];

void dfs(int r, int c)
{
  stack<int> S;
  S.push(r);
  color[r] = c;
  while (!S.empty())
  {
    int u = S.top();
    S.pop();
    for (int i = 0; i < G[u].size(); i++)
    {
      int v = G[u][i];
      if (color[v] == NIL)
      {
        color[v] = c;
        S.push(v);
      }
    }
  }
}

void assignColor()
{
  int id = 1;
  for (int i = 0; i < n; i++)
  {
    color[i] = NIL;
  }
  for (int u = 0; u < n; u++)
  {
    if (color[u] == NIL)
    {
      dfs(u, id++);
    }
  }
}

int main()
{
  int s, t, m, q;
  cin >> n >> m;

  for (int i = 0; i < m; i++)
  {
    cin >> s >> t;
    G[s].push_back(t);
    G[t].push_back(s);
  }

  assignColor();

  cin >> q;

  for (int i = 0; i < q; i++)
  {
    cin >> s >> t;
    if (color[s] == color[t])
    {
      cout << "yes" << endl;
    }
    else
    {
      cout << "no" << endl;
    }
  }

  return 0;
}

C++: #include<iostream>
#include<vector>
#include<stack>
#include<cstdio>
using namespace std;
static const int MAX = 1000000;
static const int NIL = -1;

int n;
vector<int> G[MAX];     //頂点数を1000000とする
                        //隣接リスト
int color[MAX];

void dfs( int r, int c ) {
    stack<int> S;
    S.push(r);          //始点rをスタックに追加
    color[r] = c;       //色をいれる
    while ( !S.empty() ) {
        int u = S.top();
        S.pop();        //スタックから頂点uを取り出し訪問
        for ( int i = 0; i < G[u].size(); ++i ) {
            int v = G[u][i];
            //頂点uに隣接する頂点vを探索
            if ( color[v] == NIL ) {
                color[v] = c;
                S.push(v);//id(色)は変わらない
            }
        }
    }
}

void assignColor() {
    int id = 1;             //全てにNIL
    for ( int i = 0; i < n; ++i ) color[i] = NIL;
    for ( int u = 0; u < n; ++u ) {
        if ( color[u] == NIL ) dfs( u , id++ ); //id(色)にかぶりがないように
    }
}

int main() {
    int s, t, m, q;

    scanf("%d %d",&n,&m);

    for ( int i = 0; i < m; ++i ) {
        scanf("%d %d",&s,&t);
        G[s].push_back(t);  // s → tへ辺
        G[t].push_back(s);  // t → sへ辺
    }

    assignColor();

    scanf("%d",&q);

    for ( int i = 0; i < q; ++i ) {
        scanf("%d %d",&s,&t);
        if ( color[s] == color[t] ) {
            puts("yes");
        } else {
            puts("no");
        }
    }

    return 0;
}

C++: #include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#define Lens 1005
#define Nil -1

using namespace std;
int n, m, q;
queue<int> Q;
vector<int> A[Lens];
int c[Lens], d[Lens];
int way[Lens][Lens];

void bns(int k, int v)
{
	Q.push(k);
	c[k] = v;
	while (!Q.empty())
	{
		k = Q.front();
		Q.pop();
		c[k] = v;
		for (int i = 0; i < A[k].size(); i++)
		{
			int tmp = A[k][i];
			if (c[tmp] == Nil)
			{
				Q.push(tmp);
			}
		}
	}
}

int main()
{
	int v = 1;
	cin >> n >> m;
	for (int i = 0; i < m; i++)
	{
		int s, t;
		cin >> s >> t;
		c[s] = c[t] = Nil;
		A[s].push_back(t);
		A[t].push_back(s);
	}
	for (int i = 0; i < n; i++)
	{
		if (c[i] == Nil)
		{
			bns(i, v);
			v++;
		}

	}
	cin >> q;
	for (int i = 0; i < q; i++)
	{
		int s, t;
		cin >> s >> t;

		if (c[s] == c[t]&&c[s]!=Nil&&c[s]!=0)
			cout << "yes" << endl;
		else
			cout << "no" << endl;
	}
	return 0;
}

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

using namespace std;
struct user {
    user() {};
    user(int i) : id {i}, fs {}, group {-1} {};
    int id;
    vector<int> fs;
    int group;
};

void add_friends(user *us, int x, int y){
    us[x].fs.push_back(y);
    us[y].fs.push_back(x);
}

void dfs(user* us, int id, int g){
    if(us[id].group == g){
        return;
    }
    us[id].group = g;
    vector<int> fs = us[id].fs;
    for(auto x : fs){
        dfs(us, x, g);
    }
}

void make_group(user* us, int n){
    int g = 0;
    for(int i = 0; i < n; ++i){
        if(us[i].group < 0){
            dfs(us, i, g);
            ++g;
        }
    }
}

int main(){
    int n, m;
    cin >> n >> m;
    user us[n];
    for(int i = 0; i < n; ++i){
        us[i] = user(i);
    }
    for(int i = 0; i < m; ++i){
        int a, b;
        cin >> a >> b;
        add_friends(us, a, b);
    }
    make_group(us, n);
    int q;
    cin >> q;
    for(int i = 0; i < q; ++ i){
        int a, b;
        cin >> a >> b;
        if(us[a].group == us[b].group){
            cout << "yes" << endl;
        } else {
            cout << "no" << endl;
        }
    }
}

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

int main(){
	int n,m,q,i,j;
	int s,t;
	vector<int> L(100005,-1);
	cin >> n >> m;
	
	for (j=0;j<n;j++){
		L[j]=j;
	}
	
	for (i=0;i<m;i++){
		cin >> s >> t ;
		if (L[s]!=L[t]){
			int a=L[t];
			for (j=0;j<n;j++){
				if (L[j]==a){
					L[j]=L[s];
				}
			}
		}
	}
	
	cin >> q;
	for (i=0;i<q;i++){
		cin >> s >> t;
		if (L[s]==L[t]){
			cout << "yes" <<endl;
		}else{
			cout << "no" <<endl;
		}
	}
	
	for (i=0;i<n;i++){
		cout << L[i] << endl;
	} 
	
	return 0;
}

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

vector<int> *v;
int *color;
int n;

void dfs(int i, int c){
        if(color[i]==c) return;
        color[i]=c;
        for(int j=0;j<v[i].size();j++)
                dfs(v[i][j], c);
}

void assignColor(){
        int c = 1;
        for(int i=0;i<n;i++){
                if(color[i]!=0) continue;
                dfs(i,c);
                c++;
        }

}

int main(){
        int m,q,a,b;
        cin>>n>>m;
        v = new vector<int>[n];
        color = new int[n];
        for(int i=0;i<m;i++){
                cin>>a>>b;
                v[a].emplace_back(b);
                v[b].emplace_back(a);
        }
        for(int i=0;i<n;i++) color[i] = 0;

        assignColor();

        cin>>q;
        for(int i=0;i<q;i++){
                cin>>a>>b;
                if(color[a]==color[b]) cout<<"yes"<<endl;
                else cout<<"no"<<endl;
        }

        return 0;
}