#include<iostream>
#include<cstdio>
using namespace std;
#define N 10000 + 10
int p[N],rp[N];
int find(int x,int* fa)
{
if(x == fa[x]) return x;
return fa[x] = find(fa[x],fa);
}
void merge(int from,int to)
{
if(from > 1) p[from] = find(to,p);//固定1为根节点,正向建树
if(to > 1) rp[to] = find(from,rp);//反向建树
}
int main()
{
int n,m;
while(scanf("%d%d",&n,&m)) {
if(n == 0 && m == 0) break;
for(int i = 1; i <= n; i++)
p[i] = rp[i] = i;
int from,to;
for(int i = 0; i < m; i++) {
scanf("%d%d",&from,&to);
merge(from,to);
}
int flag = 1;
for(int i = 1; i <= n; i++)
if(find(i,p) != 1 || find(i,rp) != 1) {//如果存在不是以1为根结点的点,则不是强连通图
flag = 0;
break;
}
if(flag) printf("Yes\n");
else printf("No\n");
}
return 0;
}
相关题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1269
这道题也可以用tarjan算法来做