小希的迷宫 && Is It A Tree?——并查集 / 图转化成树

一、无向图转化成树 （也可用并查集）

Description

上次Gardon的迷宫城堡小希玩了很久（见Problem B），现在她也想设计一个迷宫让Gardon来走。但是她设计迷宫的思路不一样，首先她认为所有的通道都应该是双向连通的，就是说如果有一个通道连通了房间A和B，那么既可以通过它从房间A走到房间B，也可以通过它从房间B走到房间A，为了提高难度，小希希望任意两个房间有且仅有一条路径可以相通（除非走了回头路）。小希现在把她的设计图给你，让你帮忙判断她的设计图是否符合她的设计思路。比如下面的例子，前两个是符合条件的，但是最后一个却有两种方法从5到达8。 

 

Input

输入包含多组数据，每组数据是一个以0 0结尾的整数对列表，表示了一条通道连接的两个房间的编号。房间的编号至少为1，且不超过100000。每两组数据之间有一个空行。 
整个文件以两个-1结尾。 

 

Output

对于输入的每一组数据，输出仅包括一行。如果该迷宫符合小希的思路，那么输出"Yes"，否则输出"No"。 

 

Sample Input

6 8 5 3 5 2 6 4 
5 6 0 0 

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

3 8 6 8 6 4 
5 3 5 6 5 2 0 0 

-1 -1 

Sample Output

Yes 
Yes 
No 

                      判断是否任意两个房间之间都有且仅有一条路连接

（１）、方法一：并查集

思路：

如果仅有一条路连接的话，说明该两点之间不能存在回路，满足仅有一条路

用并查集来搞，如果两个点的父亲节点不同的话，就合并两点 ； 如果节点的父亲节点相同的话，说明两个节点之间已经存在了一条通路，如果再有一条就会形成回路，那么就不满足仅有一条路连接

除了满足以上条件之外，还需满足有一条路，即还需判断两点是否是在一个集合中，即判断是否只有一个集合

特判的情况，如果是空树的情况，那么满足任意两点之间有且仅有一条路

 

CODE:

#include <iostream>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long LL;
#define memset(a,n) memset(a,n,sizeof(a))

int flag=0;
int father[100000+10];
int vis[100000+10];

int findd(int a)
{
    if(a!=father[a])
        father[a] = findd(father[a]);

    return father[a];
}

void Union(int x,int y)
{
    int root,root1;
    root=findd(x);
    root1=findd(y);
    if(root!=root1)
        father[root]=root1;
    else
        flag=1;
}
int main()
{
    int a,b;
    int m,n;
    int maxx = -1;
    int flagg = -1;
    int cnt=0;

    while(scanf("%d %d",&a,&b)&&a!=-1&&b!=-1)
    {
        flag = 0;
        maxx = -1;
        flagg=0;
        cnt = 0;

        if(a==0&&b==0)
        {
            printf("Yes\n");
            continue;
        }
        for (int i=0; i<=100000; i++){
            father[i] = i;
            vis[i] = 0;
        }

        vis[a] = 1;
        vis[b] = 1;
        flag = 0;

        maxx = max(maxx,max(a,b));

        Union(a,b);

        while(scanf("%d %d",&a,&b)&&a!=0&&b!=0)
        {
            maxx = max(maxx,max(a,b));

            vis[a] = 1;
            vis[b] = 1;
            Union(a,b);
        }
        

        if(flag)
        {
            printf("No\n");
            continue;
        }

        // 判断是否是只有一个集合

        for (int i=1; i<=maxx; i++)  
        {
            if(vis[i]&&father[i]==i)
                cnt++;
            if(cnt>=2){
                flagg = 1;
                break;
            }
        }
        if(flagg)
            printf("No\n");
        else
            printf("Yes\n");
    }
}

 

方法二：利用　树　的性质

判断是否任意两个房间之间都有且仅有一条路连接，即判断 点数 是否等于 边数 + 1

---

一个图是否是树需要满足：

 1、空树也是树

2、一个图若是树需满足两个条件：

①连通分量为一；

②图中无环，包括自环和非自环

3、点数 = 边数 + 1

以上几点只是针对无向图的

而如果要判断有向图是否是树，还要判断 顶点的入度，满足入度为0的点只有一个，以及其他入度都不大于1（下文有描述）

 

CODE：

#include <iostream>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long LL;
#define memset(a,n) memset(a,n,sizeof(a))

int flag=0;
int vis[100000+10];

int main()
{
    int a,b;
    int cnt=0,len=0;

    while(scanf("%d %d",&a,&b)&&a!=-1&&b!=-1)
    {
        memset(vis,0);
        cnt = 0;
        len = 0;

        if(a==0&&b==0)  // 空树的情况
        {
            printf("Yes\n");
            continue;
        }

        vis[a] = 1;
        vis[b] = 1;
        cnt+=2;
        len++;

        while(scanf("%d %d",&a,&b)&&a!=0&&b!=0)
        {
            if (!vis[a]){  // 没有出现过的点加 1
                vis[a] = 1;
                cnt++;
            }
            if (!vis[b]){
                vis[b] = 1;
                cnt++;
            }
            len++;  // 边数 加 1
        }
    
        if (cnt == len+1)  // 点数 = 边数 + 1
            printf("Yes\n");
        else
            printf("No\n");
    }
}

 

二、有向图转化成树（也可用并查集）

Description

A tree is a well-known data structure that is either empty (null, void, nothing) or is a set of one or more nodes connected by directed edges between nodes satisfying the following properties. 

There is exactly one node, called the root, to which no directed edges point. 
Every node except the root has exactly one edge pointing to it. 
There is a unique sequence of directed edges from the root to each node. 
For example, consider the illustrations below, in which nodes are represented by circles and edges are represented by lines with arrowheads. The first two of these are trees, but the last is not. 

In this problem you will be given several descriptions of collections of nodes connected by directed edges. For each of these you are to determine if the collection satisfies the definition of a tree or not.

Input

The input will consist of a sequence of descriptions (test cases) followed by a pair of negative integers. Each test case will consist of a sequence of edge descriptions followed by a pair of zeroes Each edge description will consist of a pair of integers; the first integer identifies the node from which the edge begins, and the second integer identifies the node to which the edge is directed. Node numbers will always be greater than zero.

Output

For each test case display the line "Case k is a tree." or the line "Case k is not a tree.", where k corresponds to the test case number (they are sequentially numbered starting with 1).

Sample Input

6 8  5 3  5 2  6 4
5 6  0 0

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

3 8  6 8  6 4
5 3  5 6  5 2  0 0
-1 -1

Sample Output

Case 1 is a tree.
Case 2 is a tree.
Case 3 is not a tree.

题意和上题一样，只是这是一个有向图

方法一：并查集用上边的代码，改一下输出即可

CODE:

#include <iostream>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long LL;
#define memset(a,n) memset(a,n,sizeof(a))

int flag=0;
int father[100000+10];
int vis[100000+10];

int findd(int a)
{
    if(a!=father[a])
        father[a] = findd(father[a]);

    return father[a];
}

void Union(int x,int y)
{
    int root,root1;
    root=findd(x);
    root1=findd(y);
    if(root!=root1)
        father[root]=root1;
    else
        flag=1;
}
int main()
{
    int a,b;
    int m,n;
    int maxx = -1;
    int flagg = -1;
    int cnt=0,sum=0;

    while(scanf("%d %d",&a,&b)&&a!=-1&&b!=-1)
    {
        sum++;

        flag = 0;
        maxx = -1;
        flagg=0;
        cnt = 0;

        if(a==0&&b==0)
        {
            printf("Case %d is a tree.\n",sum);
            continue;
        }
        for (int i=0; i<=100000; i++){
            father[i] = i;
            vis[i] = 0;
        }

        vis[a] = 1;
        vis[b] = 1;
        flag = 0;

        maxx = max(maxx,max(a,b));

        Union(a,b);

        while(scanf("%d %d",&a,&b)&&a!=0&&b!=0)
        {
            maxx = max(maxx,max(a,b));

            vis[a] = 1;
            vis[b] = 1;
            Union(a,b);
        }
    
        if(flag)
        {
            printf("Case %d is not a tree.\n",sum);
            continue;
        }

        for (int i=1; i<=maxx; i++)
        {
            if(vis[i]&&father[i]==i)
                cnt++;
            if(cnt>=2){
                flagg = 1;
                break;
            }
        }
        if(flagg)
            printf("Case %d is not a tree.\n",sum);
        else
            printf("Case %d is a tree.\n",sum);
    }
}

重点说一下方法二：有向图转化成树

---

一个图是否是树需要满足：

 1、空树也是树

2、一个图若是树需满足两个条件：

①连通分量为一；

②图中无环，包括自环和非自环

3、点数 = 边数 + 1

而如果要判断有向图是否是树，还要判断 顶点的入度，满足入度为0的点只有一个，以及入度都不大于1

用 v 数组记录一下入度情况即可

CODE :

#include <iostream>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long LL;
#define memset(a,n) memset(a,n,sizeof(a))

int flag=0;

int vis[100000+10];
int v[100000+10];

int main()
{
    int a,b;
    int cnt=0,len=0,sum=0,flag=0,ans=0;
    int maxx=-1;

    while(scanf("%d %d",&a,&b)&&a!=-1&&b!=-1)
    {
        memset(vis,0);
        memset(v,0);
        ans++;
        cnt = 0;
        len = 0;
        flag = 0;
        sum = 0;

        if(a==0&&b==0)
        {
            printf("Case %d is a tree.\n",ans);
            continue;
        }

        vis[a] = 1;
        vis[b] = 1;
        cnt+=2;
        len++;
        v[b] += 1;
        maxx = -1;
        maxx = max(maxx,max(a,b));

        while(scanf("%d %d",&a,&b)&&a!=0&&b!=0)
        {
            if (!vis[a])
            {
                vis[a] = 1;
                cnt++;
            }
            if (!vis[b])
            {
                vis[b] = 1;
                cnt++;
            }

            v[b] += 1;
            len++;
            maxx = max(maxx,max(a,b));
        }


        for (int i=1; i<=maxx; i++)
        {
            if (v[i]==0&&vis[i]){
                sum++;
            }

            if (v[i]>1&&vis[i])
            {
                flag=1;
                break;
            }
        }

        if(flag == 1)
            printf("Case %d is not a tree.\n",ans);
        else
        {
            if(sum==1&&cnt==len+1)
                printf("Case %d is a tree.\n",ans);
            else
                printf("Case %d is not a tree.\n",ans);
        }
    }
}