题意
给出 n n 个点条有向边,判断整张图是否为一个强连通分量。
题解
Tarjan或并查集维护即可。
代码
#include <bits/stdc++.h>
using namespace std;
const int nmax = 1e5 +10;
const int INF = 0x3f3f3f3f;
int low[nmax];
int dfn[nmax];
int sstack[nmax];
int head[nmax];
int color[nmax];
bool visit[nmax];
typedef struct{
int nxt,to;
}Edge;
Edge e[nmax<<1];
int n,m,tot,top,dfnnum,sccnum;
void add(int u, int v){
e[tot].to = v;
e[tot].nxt = head[u];
head[u] = tot++;
}
void init(){
memset(head,-1,sizeof head);
memset(visit,0,sizeof visit);
memset(e,0,sizeof e);
memset(dfn,0,sizeof dfn);
top = tot = dfnnum = sccnum = 0;
}
void tarjan(int u){
low[u] = dfn[u] = ++dfnnum;
visit[u] = true;
sstack[++top] = u;
for(int i = head[u] ; i != -1; i = e[i].nxt){
int v = e[i].to;
if(!dfn[v]){
tarjan(v);
low[u] = min(low[u],low[v]);
}else if(visit[v]) low[u] = min(low[u], dfn[v]);
}
if(dfn[u] == low[u]){
visit[u] = false;
color[u] = ++ sccnum;
while(sstack[top] != u){
color[sstack[top]] = sccnum;
visit[sstack[top]] = false;
top--;
}
top--;
}
}
int main(){
while(scanf("%d %d",&n,&m)!=EOF){
if(n == 0 && m == 0) break;
init();
int u,v;
for(int i = 1;i<=m;++i){
scanf("%d %d",&u,&v);
add(u,v);
}
for(int i = 1;i<=n;++i)
if(!dfn[i]) tarjan(i);
// printf("debug %d\n",sccnum);
if(sccnum == 1) puts("Yes");
else puts("No");
}
return 0;
}