师兄给的模板
/*2012-12-06 20:16:08 Accepted 1269 46MS 1484K 1339 B C++*/
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
#define maxn 10010
int n;
vector<int> g[maxn];
int Bcnt; /// 强连通分量的个数;
int Top; /// 栈顶;
int Index; /// 时间戳;
int low[maxn], dfn[maxn];
int belong[maxn], stack[maxn];
bool instack[maxn];
void Init_tarjan(){
Bcnt= Top= Index= 0;
for(int i=1; i<=n; ++i) low[i]= dfn[i]= 0;
}
void Tarjan(int u){
stack[Top++]= u;
instack[u]= 1;
low[u]= dfn[u]= ++Index;
for(int i=0; i<g[u].size(); ++i){
int v= g[u][i];
if( !dfn[v] ){
Tarjan(v);
low[u]= min( low[v], low[u] );
}
else if( instack[v] )
low[u]= min( low[u], dfn[v] );
}
if( low[u]==dfn[u] ){
++Bcnt;
int v;
do{
v= stack[--Top];
instack[v]= 0;
belong[v]= Bcnt;
}while( u!=v );
}
}
int main()
{
int m;
while( cin>>n>>m, n+m ){
for(int i=1; i<=n; ++i) g[i].clear();
while(m--){
int x, y;
scanf("%d%d", &x, &y);
g[x].push_back(y);
}
Init_tarjan();
for(int i=1; i<=n; ++i){
if( !dfn[i] )
Tarjan(1);
}
puts( Bcnt==1 ? "Yes" : "No" );
}
}
自己写的 (貌似没什么差别。。- -)
#include<iostream>
#include<cstdio>
#include<cstring>
#include<vector>
using namespace std;
#define MAXN 10010
int Index,CNT,Top;
int dfn[MAXN],low[MAXN],stack[MAXN],Belong[MAXN];
bool Instack[MAXN];
vector<int>G[MAXN];
void Init_Tarjan(int n){
for(int i=1;i<=n;i++){
G[i].clear();
dfn[i]=low[i]=Belong[i]=0;
Instack[i]=0;
}
Index=CNT=Top=0;
}
int Tarjan(int u){
int v;
dfn[u]=low[u]=++Index;
stack[++Top]=u;
Instack[u]=1;
for(int i=0;i<G[u].size();i++){
v=G[u][i];
if(!dfn[v]){
Tarjan(v);
low[u]=min(low[u],low[v]);
}
else if(Instack[v]) low[u]=min(dfn[v],low[u]);
}
if(dfn[u]==low[u]){
CNT++;
do{
v=stack[Top--];
Belong[v]=CNT;
Instack[v]=0;
}while(u!=v);
}
}
int main()
{
int i,j,k,n,m;
while(scanf("%d%d",&n,&m),n+m){
Init_Tarjan(n);
for(i=1;i<=m;i++){
int x,y;
scanf("%d%d",&x,&y);
G[x].push_back(y);
}
for(i=1;i<=n;i++)
if(!dfn[i]) Tarjan(i);
for(i=2;i<=n;i++) if(Belong[i]!=Belong[i-1]) break;
if(i>n) puts("Yes");
else puts("No");
}
return 0;
}