图论（6）-Legal or Not（拓扑排序）

Legal or Not

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


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

意思是说在QQ群里有很多师徒关系，如A是B的师父，同时B是A的徒弟，一个师父可以有很多徒弟，一个徒弟也能有很多不同的师父，但是A是B的师父，B是C的师父，反过来C又是A的师父，这是一个非法的情况。

明显用拓扑排序。

///
/// @file    test1.cc
/// @author  miaobeihai(452686191@qq.com)
/// @date    2017-03-07 16:56:11
///
#include<stdio.h>
#include<stdlib.h>
#include<vector>
#include<queue>
using namespace std;
vector<int> edge[100];
queue<int> Q;
int Indegree[100];

int main()
{
	int n,m;
	int i,j;
	while(scanf("%d%d",&n,&m)!=EOF)
	{
		if(n==0&&m==0)break;
		for(i=0;i<n;i++)
		{
			Indegree[i]=0;
			edge[i].clear();
		}
		while(m--){
			int a,b;
			scanf("%d%d",&a,&b);
			edge[a].push_back(b);
			Indegree[b]++;
		}
		while(Q.empty()==false) Q.pop();
		for(i=0;i<n;i++){
			if(Indegree[i]==0)
				Q.push(i);
		}
		int cnt=0;
		while(Q.empty()==false)
		{
			int nowp=Q.front();
			Q.pop();
			cnt++;
			for(j=0;j<edge[nowp].size();j++)
			{
				Indegree[edge[nowp][j]]--;
				if(Indegree[edge[nowp][j]]==0){
					Q.push(edge[nowp][j]);
				}
			}
		}
		if(cnt==n)printf("Yes\n");
		else printf("No\n");
	}
	system("pause");
	return 0;
}