Go: package main

import (
	"fmt"
)

var n, m int
var g [][]int
var color []int

func main() {
	fmt.Scan(&n, &m)
	g = make([][]int, n) // SNSの関係を表すグラフ
	for i := 0; i < m; i++ {
		var a, b int
		fmt.Scan(&a, &b)
		g[a] = append(g[a], b) // 無向重みなしグラフ
		g[b] = append(g[b], a)
	}
	color = make([]int, n) // 各ノードにつける色
	for i := 0; i < len(color); i++ {
		color[i] = -1 // 初期化しておく
	}
	type query struct {
		s, t int
	}
	var Q int
	fmt.Scan(&Q)
	qs := make([]query, Q)
	for i := 0; i < Q; i++ {
		fmt.Scan(&qs[i].s, &qs[i].t)
	}
	// fmt.Println("n", n, "m", m, "g", g, "Q", Q, "qs", qs)
	// 全ての頂点からdfsする
	id := 1
	for u := 0; u < n; u++ {
		if color[u] == -1 {
			dfs(u, id)
			id++
		}
	}
	// fmt.Println("color", color)
	for i := 0; i < Q; i++ {
		if color[qs[i].s] == color[qs[i].t] {
			fmt.Println("yes")
		} else {
			fmt.Println("no")
		}
	}
}

func dfs(v, c int) {
	// fmt.Printf("dfs(v %d, c %d) en:\n", v, c)
	color[v] = c
	for _, vv := range g[v] {
		// fmt.Printf("  v %d, g[v] %v, vv %d\n", v, g[v], vv)
		if color[vv] == -1 {
			dfs(vv, c)
		}
	}
}

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

const int MAX=100005;
vector<int> S[MAX];

int par[MAX];
int root(int a){
    if(par[a]==a) return a;
    else return par[a]=root(par[a]);
}
void unite(int a,int b){
    if(root(a)!=root(b)) par[root(b)]=root(a);
}
bool check(int a,int b){
    return root(a)==root(b);
}

int main(){

    int N,M;cin>>N>>M;
    for(int i=0;i<N;i++){
        par[i]=i;
    }
    for(int i=0;i<M;i++){
        int a,b;cin>>a>>b;
        unite(a,b);
    }
    int Q;cin>>Q;
    for(int i=0;i<Q;i++){
        int a,b;cin>>a>>b;
        if(check(a,b)) cout<<"yes"<<endl;
        else cout<<"no"<<endl;
    }

}

C++: #include <bits/stdc++.h>
#define ll long long
#define INF 999999999
#define MOD 1000000007

using namespace std;

typedef pair<int,int>P;

const int MAX_N = 100000;

int par[MAX_N];
int rank[MAX_N];

void initial(int n){		//?????????
	for(int i=0;i<n;i++){
		par[i] = i;
		rank[i] = 0;
	}
}

int find(int x){		//??¨??????????±???????
	if(par[x] == x){
		return x;
	}else{
		return par[x] = find(par[x]);
	}
}

void unite(int x,int y){
	x = find(x);
	y = find(y);
	if(x == y) return;
	if(rank[x] < rank[y]){
		par[x] = y;
	}else{
		par[y] = x;
		if(rank[x] == rank[y])
			rank[x]++;
	}
}

bool same(int x,int y){
	return find(x) == find(y);
}

int main()
{
	int n,m,q;
	int a,b;
	cin >> n;
	cin >> m;
	initial(n);
	for(int i=0;i<m;i++){
		cin >> a;
		cin >> b;
		unite(a,b);
	}
	cin >> q;
	for(int i=0;i<q;i++){
		cin >> a;
		cin >> b;
		if(same(a,b)){
			cout << "yes\n";
		}else{
			cout << "no\n";
		}
	}
}

C++: #include <cstdio>
#include <queue>
#include <vector>

std::queue<int> q;
typedef struct{
	bool isVisited;
	std::vector<int> neighbors;
} node;

void bfs(node* nodes, int t){
	int id;
	while (!q.empty()){
		id = q.front();
		q.pop();
		if (!nodes[t].isVisited){
			for (int i=0; i<nodes[id].neighbors.size(); i++){
				if (!nodes[nodes[id].neighbors[i]].isVisited){
					q.push(nodes[id].neighbors[i]);
					nodes[nodes[id].neighbors[i]].isVisited=true;
				}
			}
		}
	}
	if (nodes[t].isVisited) printf("yes\n");
	else printf("no\n");
}

int main(){
	int n, d, num_relation, n_query, s, t;
	node *nodes;

	scanf("%d %d", &n, &num_relation);
	nodes = new node[n];
	for(int i=0;i<num_relation;i++){
		scanf("%d %d", &s, &t);
		nodes[s].neighbors.push_back(t);
		nodes[t].neighbors.push_back(s);
	}

	scanf("%d", &n_query);
	for(int i=0;i<n_query;i++){
		for (int j=0; j<n;j++){
			nodes[j].isVisited=false;
		}
		scanf("%d %d", &s, &t);
		q.push(s);
		bfs(nodes, t);
	}

	delete []nodes;
	return 0;
}

C++: #include <iostream>

using namespace std;

const int N = 100000;
int A[N][N] = {{0}};
int n;

bool dfs(int s, int t) {
    if (A[s][t] == 1) {
        return true;
    }
    for (int i = 0; i < n; ++i) {
        if (i != t && A[s][i] != 0) {
            if (dfs(i, t)) {
                return true;
            }
        }
    }
    return false;
}

int main() {
    int m;
    cin >> n >> m;
    for (int i = 0; i < m; ++i) {
        int s, t;
        cin >> s >> t;
        A[s][t] = 1;
    }

    int q;
    cin >> q;
    for (int j = 0; j < q; ++j) {
        int x, y;
        cin >> x >> y;

        if (dfs(x, y)) {
            cout << "yes";
        } else {
            cout << "no";
        }
        cout << endl;
    }

    return 0;
}

C++: #include <iostream>#include <vector>#include <queue>static const int MAX=100000;using namespace std;vector<int> follow[MAX];int color[MAX];  //-1 represent No Visitedvoid bfs(int i,int c){    queue<int> Q;    Q.push(i);color[i]=c;    while(!Q.empty())    {        int p=Q.front();Q.pop();        for(int j=0;j<follow[p].size();j++)        {            if(color[follow[p][j]]!=-1) continue;            //else            Q.push(follow[p][j]); color[follow[p][j]]=color[p];        }    }}int main(){   int n,m;   cin>>n>>m;   for(int i=0;i<n;i++) color[i]=-1;   for(int i=0;i<m;i++)   {       int a,b;       cin>>a>>b;       follow[a].push_back(b);       follow[b].push_back(a);   }   int c=0;   for(int i=0;i<n;i++)   {       if(color[i]==-1)       {           bfs(i, c);           c++;       }   }   int order_num;cin>>order_num;   for(int i=0;i< order_num;i++)   {       int a,b;       cin>>a>>b;       if(color[a]==color[b]) cout<<"yes"<<endl;       else cout<<"no"<<endl;   }}

C++: #include <stdio.h>
#include <iostream>
#include <utility>
#include <algorithm>
#include <math.h>
#include <vector>
#include <list>
#define N 100000
using namespace std;
int n;
list<int> adj[N];
bool f[N] = {};

bool PathExists(int u, int v)
{
    f[u] = true;
    if (u == v)
        return true;
    while (!adj[u].empty())
    {
        if (!f[adj[u].front()] && PathExists(adj[u].front(), v))
            return true;
        adj[u].pop_front();
    }

    return false;
}

int main()
{
    int m, u, v, q;
    cin >> n >> m;

    for (int i = 0; i < m; i++)
    {
        cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }

    cin >> q;
    for (int i = 0; i < q; i++)
    {
        cin >> u >> v;
        if (PathExists(u, v))
            printf("yes\n");
        else
            printf("no\n");
    }

    return 0;
}

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

using namespace std;

template<typename ISTREAM>
void readGraphListFromFriendInfo(ISTREAM& cin, vector< vector<int> >& friendGraphList) {
	size_t n;
	cin >> n;
	friendGraphList = vector< vector<int> >(n);
	size_t m;
	cin >> m;
	for (size_t i = 0; i != m; ++i) {
		size_t s,t;
		cin >> s >> t;
		friendGraphList.at(s).push_back(t);
		friendGraphList.at(t).push_back(s);
	}
	for (auto& v : friendGraphList)v.shrink_to_fit();
}

bool checkFriendAccesibility(const vector<vector<int>>& graphList, const int s, const int t, vector<bool>& isVisitList) {
	const size_t n = graphList.size();
	queue<int> nodeQueue;
	//vector<int> distanceList(n, -1);//
	fill(isVisitList.begin(), isVisitList.end(), false);
	nodeQueue.push(s);
	while (!nodeQueue.empty()) {
		const int id = nodeQueue.front();
		isVisitList.at(id).flip();//trueにする
		const auto& adjList = graphList.at(id);
		for (const auto& adjID : adjList) {
			if (isVisitList.at(adjID))continue;
			const vector<int>& idList = graphList.at(adjID);
			if ( find(idList.begin(), idList.end(), id ) == idList.end())continue;
			if (adjID == t)return true;
			nodeQueue.push(adjID);
		}
		nodeQueue.pop();
	}
	return false;
}

template<typename T>
void execute(T& cin) {
	vector< vector<int> > graphList;
	readGraphListFromFriendInfo(cin, graphList);
	vector<bool> isVisitList(graphList.size(), false);
	int q, s, t;
	cin >> q;
	for (int i = 0; i != q; ++i) {
		cin >> s >> t;
		cout << (checkFriendAccesibility(graphList, s, t, isVisitList) ? "yes" : "no") << endl;
	}
}

int main()
{

	execute(cin);

	return 0;
}