Go: package main

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

// Node 頂点
type Node struct {
	gid  int   // グループID
	edge []int // 隣接辺
}

// NoID グループIDなし
const NoID = -1

// NewNode 頂点の生成
func NewNode() *Node {
	return &Node{gid: NoID, edge: []int{}}
}

func parseNode(nodes []*Node, gid int, queue []int) {
	if len(queue) == 0 {
		return
	}
	var nextQ []int
	for _, id := range queue {
		node := nodes[id]
		if node.gid == NoID {
			node.gid = gid
			for _, edge := range node.edge {
				nextQ = append(nextQ, edge)
			}
		}
	}
	parseNode(nodes, gid, nextQ)
	return
}
func digNode(nodes []*Node, id, gid int) {
	node := nodes[id]
	if node.gid != NoID {
		// 探索済み
		return
	}
	node.gid = gid
	for _, edge := range node.edge {
		digNode(nodes, edge, gid)
	}
	return
}

func main() {
	scanner := bufio.NewScanner(os.Stdin)
	n, m := eGetInt2(scanner)

	nodes := make([]*Node, n)
	for i := 0; i < n; i++ {
		nodes[i] = NewNode()
	}

	for i := 0; i < m; i++ {
		a, b := eGetInt2(scanner)
		nodes[a].edge = append(nodes[a].edge, b)
		nodes[b].edge = append(nodes[b].edge, a)
	}

	for i := 0; i < n; i++ {
		// 幅優先探索
		// gid := i
		// queue := []int{i}
		// parseNode(nodes, gid, queue)

		// 深さ優先探索
		digNode(nodes, i, i)
	}

	q := eGetInt(scanner)
	for i := 0; i < q; i++ {
		a, b := eGetInt2(scanner)
		if nodes[a].gid == nodes[b].gid {
			fmt.Println("yes")
		} else {
			fmt.Println("no")
		}
	}
}

func eGetInt(scanner *bufio.Scanner) int {
	t := eAtoi(strings.Fields(eGetline(scanner)))
	return t[0]
}
func eGetInt2(scanner *bufio.Scanner) (int, int) {
	t := eAtoi(strings.Fields(eGetline(scanner)))
	return t[0], t[1]
}

func eGetline(p *bufio.Scanner) string {
	if !p.Scan() {
		if err := p.Err(); err != nil {
			log.Fatal(err.Error())
		}
		return ""
	}
	return p.Text()
}

func eAtoi(s []string) []int {
	ints := make([]int, len(s))
	var err error
	for i, e := range s {
		ints[i], err = strconv.Atoi(e)
		if err != nil {
			log.Fatal(err.Error())
		}
	}
	return ints
}

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

using namespace std;

int main(){
	int n, m, s, t, q, i, j;
	int id, color = 0;
	bool answer_yes = false;

	// enter
	cin >> n >> m;
	vector< vector<int> > Adj(n);
	vector<int> Stack;
	vector<int> Check(n, 0);
	vector<int>::iterator it, itend;
	for (i = 0; i < m; i++) {
		cin >> s >> t;
		Adj[s].push_back(t);
		Adj[t].push_back(s);
	}

	// calculate
	for (i = 0; i < n; i++) {
		if (Check[i] == 0) {
			color++;
			Stack.push_back(i);
			Check[i] = color;
			while (!Stack.empty()) {
				id = Stack.back();
				itend = Adj[id].end();
				for (it = Adj[id].begin(); it != itend; it++) {
					if (!Check[*it]) {
						Stack.push_back(*it);
						Check[*it] = color;
						break;
					}
				}
				if (it == itend) {
					Stack.pop_back();
				}
			}
		}
	}

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

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

#define MAX 100000

int n;
vector<int> elist[MAX];
int group[MAX]; //or bool visited

void dfs(int v,int groupParent){
    group[v] = groupParent;
    for (int i :elist[v]){
        if(group[i] == -1)dfs(i,groupParent);
    }
}

void assignGroup(){
    for (int i = 0; i < n; ++i) group[i] = -1;
    for (int i = 0; i < n; ++i) if(group[i] == -1)dfs(i,i);
}

int main(){
    freopen("in", "r", stdin);
    int m;
    cin >> n >> m;
    //NOTE : vertex id is 0 ~ n-1
    for (int i = 0; i < m; ++i){
        int s,t;
        cin >> s >> t;
        elist[s].push_back(t);
        elist[t].push_back(s);
    }
    assignGroup();
    int q;
    cin >> q;
    for (int j = 0; j < q; ++j) {
        int s,t;
        cin >> s >> t;
        string result = group[s] == group[t] ? "yes" : "no";
        cout << result << endl;
    }

    return 0;
}

C++: #include <iostream>
#include <stdio.h>
#include <vector>
#include <stack>
static const int MAX = 100000;
static const int NIL = -1;

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

void dfs(int r, int c) {
    std::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 j = 0; j < n; j++) {
        if (color[j] == NIL) dfs(j, id++);
    }
}

int main() {
    int m, s, t, q;
    
    scanf("%d %d", &n, &m);
    for (int i = 0; i < m; i++) {
        scanf("%d %d", &s, &t);
        G[t].push_back(s);
        G[s].push_back(t);
    }
    
    assignColor();
    
    scanf("%d", &q);
    for (int i = 0; i < q; i++) {
        scanf("%d %d", &s, &t);
        if (color[s] == color[t]) {
            printf("yes\n");
        } else {
            printf("no\n");
        }
    }
    
    return 0;
}

C++: #include<stdio.h>
#include<algorithm>
#include<queue>
#include<vector>
#include<string.h>
using namespace std;
#define NIL -2000000001
#define MAX 100000

int n, m;
int color[MAX];
int d[MAX];
int colorId = 0;
vector<int> G[MAX];
queue<int> queueBfs;


void assignColor() {
  queueBfs.push(0);
  color[0] = colorId;

  while (!queueBfs.empty()) {
    int front = queueBfs.front();

    int next = NIL;
    for (int i = 0; i < G[front].size(); i++) {
      if (color[G[front][i]] == NIL) {
        next = G[front][i];
        queueBfs.push(G[front][i]);
        color[G[front][i]] = colorId;
      }
    }
    queueBfs.pop();

    // NILになっている島を探す
    if (queueBfs.empty()) {
      for (int i = 0; i < n; i++) {
        if (color[i] == NIL) {
          queueBfs.push(i);
          colorId++;
          color[i] = colorId;
          break;
        }
      }
    }

  }
}

int main() {
  scanf("%d %d", &n, &m);
  for ( int i = 0; i < n; i++ ) color[i] = NIL;
  for ( int i = 0; i < m; i++ ) {
    int v1, v2;
    scanf("%d %d", &v1, &v2);
    G[v1].push_back(v2);
    G[v2].push_back(v1);
  }

  // for ( int i = 0; i < n; i++ ) {
  //   for ( int j = 0; j < G[i].size(); j++ ) printf("%d ", G[i][j]);
  //   printf("\n");
  // }

  assignColor();

  int q;
  scanf("%d", &q);
  int v1[q], v2[q];
  for ( int i = 0; i < q; i++ ) {
    scanf("%d %d", &v1[i], &v2[i]);
  }

  for ( int i = 0; i < q; i++ ) {
    if (color[v1[i]] == color[v2[i]]) {
      printf("yes\n");
    } else {
      printf("no\n");
    }
  }

  return 0;
}

C++: #include <iostream>
#include <vector>
using namespace std;
										//can this add const??
void dfs(int root, vector<int> &color, vector<vector<int> > &G, int color_id){
	//unordered_map<int, bool> visited; 
	color[root] = color_id;
	int v_size = G[root].size();
	for(int i = 0; i < v_size; i++){
		if(color[G[root][i]] == -1) dfs(G[root][i],  color, G, color_id);
	}
	//cout << "DEBUG2" << color_id << endl;
}


int main(){
	int n, m;
	cin >> n >> m;
	vector<vector<int> > G(n);//adj list
	for(int i = 0; i < m; i++){
		int u, v;
		cin >> u >> v;
		G[u].push_back(v);
		G[v].push_back(u);
	}
	//cout << "DEBUG" << endl;
	//assign color
	vector<int> color(n, -1);
	int color_id = 0;
	for(int u = 0; u < n; u++){
		if(color[u] == -1) dfs(u, color, G, color_id++);
	}
	//cout << "DEBUG1" << endl;
	int q;
	cin >> q;
	for(int i = 0; i < q; i++){
		int u, v;
		cin >> u >> v;
		if(color[u] == color[v]) cout << "yes" << endl;
		else cout << "no" << endl;
	}
	
	return 0;
}