并查集 ---- 啊哈算法

//
// Created by jal on 18-9-3.
//

#include <bits/stdc++.h>
using namespace std;
const int MAXN = 100;
int n,m;
int F[MAXN];

int father(int u){
    return F[u] == u ? u : F[u] = father(F[u]);
}
void merge(int u, int v){
    int root_u = father(u);
    int root_v = father(v);
    if(root_u != root_v){
        F[root_u] = root_v;
    }
}
int main(){
    cin >> n >> m;
    for(int i = 1; i <= n; i++){
        F[i] = i;
    }
    for(int i = 1; i <= m; i++){
        int x,y,z;
        cin >> x >> y;
        merge(x,y);
    }
    int cnt = 0;
    for(int i = 1; i <= n; i++){
        if(F[i] == i){
            cnt++;
        }
    }
    cout << cnt << endl;
}

/*
 input:

 10 9
 1 2
 3 4
 5 2
 4 6
 2 6
 8 7
 9 7
 1 6
 2 4

 output:

 3
 */
  

 

  
1
  
2
  
3
  
4
  
5
  
6
  
7
  
8
  
9
  
10
  
11
  
12
  
13
  
14
  
15
  
16
  
17
  
18
  
19
  
20
  
21
  
22
  
23
  
24
  
25
  
26
  
27
  
28
  
29
  
30
  
31
  
32
  
33
  
34
  
35
  
36
  
37
  
38
  
39
  
40
  
41
  
42
  
43
  
44
  
45
  
46
  
47
  
48
  
49
  
50
  
51
  
52
  
53
  
54
  
55
  
56
  
57
 

文章来源: blog.csdn.net，作者：爱玲姐姐，版权归原作者所有，如需转载，请联系作者。

原文链接：blog.csdn.net/jal517486222/article/details/82347698