【HDU】3342Legal or Not（判断拓扑排序模板题目）

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 11479    Accepted Submission(s): 5399   Problem Description ACM-DIY is a large QQ group where many excellent acmers get together. It is so harmonious that just like a big family. Every day,many "holy cows" like HH, hh, AC, ZT, lcc, BF, Qinz and so on chat on-line to exchange their ideas. When someone has questions, many warm-hearted cows like Lost will come to help. Then the one being helped will call Lost "master", and Lost will have a nice "prentice". By and by, there are many pairs of "master and prentice". But then problem occurs: there are too many masters and too many prentices, how can we know whether it is legal or not? We all know a master can have many prentices and a prentice may have a lot of masters too, it's legal. Nevertheless，some cows are not so honest, they hold illegal relationship. Take HH and 3xian for instant, HH is 3xian's master and, at the same time, 3xian is HH's master,which is quite illegal! To avoid this,please help us to judge whether their relationship is legal or not. Please note that the "master and prentice" relation is transitive. It means that if A is B's master ans B is C's master, then A is C's master.     Input The input consists of several test cases. For each case, the first line contains two integers, N (members to be tested) and M (relationships to be tested)(2 <= N, M <= 100). Then M lines follow, each contains a pair of (x, y) which means x is y's master and y is x's prentice. The input is terminated by N = 0. TO MAKE IT SIMPLE, we give every one a number (0, 1, 2,..., N-1). We use their numbers instead of their names.     Output For each test case, print in one line the judgement of the messy relationship. If it is legal, output "YES", otherwise "NO".     Sample Input   3 2 0 1 1 2 2 2 0 1 1 0 0 0     Sample Output   YES NO     Author QiuQiu@NJFU     Source HDOJ Monthly Contest – 2010.03.06     Recommend lcy   |   We have carefully selected several similar problems for you:  1285 2647 3333 3339 3341      Statistic | Submit | Discuss | Note

 

题目大意：给出N个点M条边，让你判断这个图是否可以实现拓扑排序

拓扑排序：

在图论中，拓扑排序（Topological Sorting）是一个有向无环图（DAG, Directed Acyclic Graph）的所有顶点的线性序列。且该序列必须满足下面两个条件：

每个顶点出现且只出现一次。
若存在一条从顶点 A 到顶点 B 的路径，那么在序列中顶点 A 出现在顶点 B 的前面。
有向无环图（DAG）才有拓扑排序，非DAG图没有拓扑排序一说。

拓扑排序的实现：

它是一个 DAG 图，那么如何写出它的拓扑排序呢？这里说一种比较常用的方法：

从 DAG 图中选择一个 没有前驱（即入度为0）的顶点并输出。
从图中删除该顶点和所有以它为起点的有向边。
重复 1 和 2 直到当前的 DAG 图为空或当前图中不存在无前驱的顶点为止。后一种情况说明有向图中必然存在环。

模板代码：

#include<cstdio>
#include<iostream>
#include<cstring>
#include<string>
#include<vector>
#include<queue>
#define maxn 110
using namespace std;
int n,m;
vector<int > G[maxn];
int in[maxn];

bool topo()
{
    queue<int >Q;
    int sum=0;
    for(int i=0;i<n;i++)
        if(in[i]==0)
            Q.push(i);

    while(!Q.empty())
    {
        int u=Q.front();Q.pop();
        sum++;
        for(int i=0;i<G[u].size();i++)
        {
            int v=G[u][i];
            if(--in[v]==0)
                Q.push(v);
        }
    }
    return sum==n;
}

int main()
{
    while(scanf("%d%d",&n,&m)&&n)
    {
        memset(in,0,sizeof(in));
        for(int i=0;i<=n;i++)
            G[i].clear();

        for(int i=0;i<m;i++)
        {
            int u,v;
            scanf("%d%d",&u,&v);
            G[u].push_back(v);
            in[v]++;
        }
        if(topo())
            printf("YES\n");
        else
            printf("NO\n");
    }
    return 0;
}