拓扑排序 （判断有向图是否存在回环）

Legal or Not

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 9777    Accepted Submission(s): 4541

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

 题目大意： 几对师徒关系问是否合法，若存在回路则不合法。

//111.CPP
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <map>
#include <queue>
#include <vector>
#define LL long long
#define Max(a,b) a>b?a:b
#define Min(a,b) a<b?a:b
#define mem(a,b) memset(a,b,sizeof(a))
using namespace std;
int ind[200];
int n,m;
vector<int>edge[105];
queue<int >q;
void init()//初始化 所有点的入度为0
{
   for(int i=0;i<n;i++)
   	 ind[i]=0;
   	mem(edge,0);
}
void add(int w,int v)//建图 记录每个点的入度
{
     edge[w].push_back(v);
     ind[v]++;
}
bool judge()
{
	for(int i=0;i<n;i++)//找到所有入度为0的点 
	{
		if(ind[i]==0)
		{
            q.push(i);
		}
	}
	int u;int cnt=0;
	while(!q.empty())
	{
        u=q.front();
        q.pop();
        cnt++;
        //cout<<u<<endl;
        int l=edge[u].size();
        for(int i=0;i<l;i++)//找到与以这个点为起点的点并且将入度减一
        {
        	int s=edge[u][i];
        	ind[s]--;
        	if(ind[s]==0) q.push(s);
        }

	}
	if(cnt==n) return true;//如果输出点的个数等于n则不存在回环
	return false;
}
int main()
{
	ios::sync_with_stdio(false);
	int u,v;
    while(cin>>n>>m)
    {
        if(n==0&&m==0)break;
    	init();
    	while(m--)
    	{
            cin>>u>>v;
            add(u,v);
    	}
    	if(judge())
    	{
    		cout<<"YES"<<endl;
    	}
    	else cout<<"NO"<<endl;
    }
}

拓扑排序：

http://blog.csdn.net/qq_35644234/article/details/60578189