数据结构——并查集

顾名思义，首先并查集属于数据结构中的一种，属于一种集合；其次，通过合并与查找结合的方式实现对数据的处理。可以将复杂的数据简单化。个人看来，并查集与搜索有相关之处，都需要先遍历数据，找出其中的“朋友关系”，将其合并、查找。举例如：

描述

Today is Ignatius’ birthday. He invites a lot of friends. Now it’s dinner time. Ignatius wants to know how many tables he needs at least. You have to notice that not all the friends know each other, and all the friends do not want to stay with strangers.

One important rule for this problem is that if I tell you A knows B, and B knows C, that means A, B, C know each other, so they can stay in one table.

For example: If I tell you A knows B, B knows C, and D knows E, so A, B, C can stay in one table, and D, E have to stay in the other one. So Ignatius needs 2 tables at least.

Input

The input starts with an integer T(1<=T<=25) which indicate the number of test cases. Then T test cases follow. Each test case starts with two integers N and M(1<=N,M<=1000). N indicates the number of friends, the friends are marked from 1 to N. Then M lines follow. Each line consists of two integers A and B(A!=B), that means friend A and friend B know each other. There will be a blank line between two cases.

Output

For each test case, just output how many tables Ignatius needs at least. Do NOT print any blanks.

Sample Input

2
5 3
1 2
2 3
4 5

5 1
2 5

Sample Output

2
4
题目大意：n个人一起吃饭，认识的人想做在一起，不认识的人不想做在一起，A与B认识，B与C认识，那么，A、B、C就坐在一起。问认识的人坐在一起需要多少张桌子。
第一步：初始化

void init_set(int n)
{
   for(int a=1;a<=n;a++)
   s[a]=a;
}

第二步：查找

int find_set(int x)
{
   return x==s[x]?x:find_set(s[x]);
}

第三步：合并

void union_set(int x,int y)
{
   x=find_set(x);
   y=find_set(y);
   if(x!=y)s[x]=s[y];
}

主函数

int main()
{
    int t;
    cin>>t;
    int x,y;
    while(t--）
    {
       int n,m;
       cin>>n>>m;
       init_set(n);
       for(int a=0;a<m;a++)
       {
          cin>>x>>y;
          union_set(x,y);
       }
       int ans=0;
       for(int a=1;a<=n;a++)
       { 
          if(a==s[a])ans++;
       }
       cout<<ans<<endl;
    }
    return 0;
}