Tarjan算法求强连通分量,强连通分量就是有向图(可以是子图)中的任意两点都能互相到达,所以我们可以用Tarjan算法去求出所有的强连通分量,相当于缩点,然后把这些缩点连接起来,就是DAG(有向无环图),DAG一定有一个点是出度为0的,可以尝试画画图。
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <queue>
#include <algorithm>
#include <vector>
#include <cmath>
#include <set>
#include <map>
#define INF 0x3f3f3f3f
#define mod 10007
#define maxn 100009
#define L rt<<1
#define R rt<<1|1
typedef long long ll;
using namespace std;
int n,m;
int cnt,ans,Count,top;
int head[maxn];
int st[maxn];
int dfn[maxn];
int low[maxn];
int belong[maxn];
int instack[maxn];
int vis[maxn];
struct node
{
int v;
int next;
} edge[maxn];
void add(int u,int v)
{
edge[cnt].v=v;
edge[cnt].next=head[u];
head[u]=cnt++;
}
void tarjan(int u)
{
int i,v;
dfn[u]=low[u]=++Count;
st[top++]=u;
instack[u]=1;
for(i=head[u]; i!=-1; i=edge[i].next)
{
v=edge[i].v;
if(!dfn[v])
{
tarjan(v);
low[u]=min(low[u],low[v]);
}
else if(instack[v]) low[u]=min(low[u],dfn[v]);
}
if(dfn[u]==low[u])
{
int temp;
ans++;
do
{
temp=st[--top];
belong[temp]=ans;
instack[temp]=0;
}
while(temp!=u);
}
}
void init()
{
memset(head,-1,sizeof(head));
memset(dfn,0,sizeof(dfn));
memset(belong,0,sizeof(belong));
memset(instack,0,sizeof(instack));
memset(low,0,sizeof(low));
top=Count=ans=cnt=0;
}
int main()
{
while(scanf("%d%d",&n,&m))
{
if(n==0&&m==0) break