Data Structures and Algorithms7-8——File Transfer

我的Data Structures and Algorithms代码仓：https://github.com/617076674/Data-Structures-and-Algorithms

原题链接：https://pintia.cn/problem-sets/16/problems/670

题目描述：

知识点：并查集

思路：并查集

由于需要新增边，且需要一边新增边，一边查询，所以深度优先遍历的做法没有并查集合适。

C++代码：

#include<iostream>
#include<set>

using namespace std;

int father[10001];

int findFather(int x);
void unionTwo(int a, int b);

int main(){
	int N;
	scanf("%d", &N);
	for(int i = 1; i <= N; i++){
		father[i] = i;
	}
	char operation[2];
	int c1, c2;
	while(true){
		scanf("%s", operation);
		if(operation[0] == 'C'){
			scanf("%d %d", &c1, &c2);
			if(findFather(c1) == findFather(c2)){
				printf("yes\n");
			}else{
				printf("no\n");
			}
		}else if(operation[0] == 'I'){
			scanf("%d %d", &c1, &c2);
			unionTwo(c1, c2);
		}else{
			break;
		}
	}
	set<int> fatherSet;
	for(int i = 1; i <= N; i++){
		fatherSet.insert(findFather(i));
	}
	if(fatherSet.size() == 1){
		printf("The network is connected.\n");
	}else{
		printf("There are %d components.\n", fatherSet.size());
	}
	return 0;
}

int findFather(int x){
	int a = x;
	while(x != father[x]){
		x = father[x];
	}
	while(a != father[a]){
		int z = a;
		a = father[a];
		father[z] = x;
	}	
	return x;
}

void unionTwo(int a, int b){
	int a_father = findFather(a);
	int b_father = findFather(b);
	if(a_father != b_father){
		father[a_father] = b_father;
	}
}

C++解题报告：