Poj 2553 The Bottom of a Graph【强连通Kosaraju+缩点染色】

The Bottom of a Graph

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 10092		Accepted: 4173

Description

We will use the following (standard) definitions from graph theory. Let V be a nonempty and finite set, its elements being called vertices (or nodes). Let E be a subset of the Cartesian product V×V, its elements being called edges. Then G=(V,E) is called a directed graph. 
Let n be a positive integer, and let p=(e₁,...,e_n) be a sequence of length n of edges e_i∈E such that e_i=(v_i,v_i+1) for a sequence of vertices (v₁,...,v_n+1). Then p is called a path from vertex v₁ to vertex v_n+1 in G and we say that v_n+1 is reachable from v₁, writing (v₁→v_n+1). 
Here are some new definitions. A node v in a graph G=(V,E) is called a sink, if for every node w in G that is reachable from v, v is also reachable from w. The bottom of a graph is the subset of all nodes that are sinks, i.e.,bottom(G)={v∈V|∀w∈V:(v→w)⇒(w→v)}. You have to calculate the bottom of certain graphs.

Input

The input contains several test cases, each of which corresponds to a directed graph G. Each test case starts with an integer number v, denoting the number of vertices of G=(V,E), where the vertices will be identified by the integer numbers in the set V={1,...,v}. You may assume that 1<=v<=5000. That is followed by a non-negative integer e and, thereafter, e pairs of vertex identifiers v₁,w₁,...,v_e,w_e with the meaning that (v_i,w_i)∈E. There are no edges other than specified by these pairs. The last test case is followed by a zero.

Output

For each test case output the bottom of the specified graph on a single line. To this end, print the numbers of all nodes that are sinks in sorted order separated by a single space character. If the bottom is empty, print an empty line.

Sample Input

3 3

1 3 2 3 3 1

2 1

1 2

0

Sample Output

1 3

2

Source

Ulm Local 2003

 

题目大意：给你一堆点，一堆边，让你找到缩点之后出度为0的节点， 然后将节点编号从小到大排序输出。

思路：Kosaraju两次Dfs，缩点染色，判断出度为0的强连通分量，将整个集合排序，输出即可。

AC代码：

#include<stdio.h>
#include<vector>
#include<string.h>
#include<algorithm>
using namespace std;
int num[100000];
int vis[100000];
int ans[100000];
vector<int >mp[100000];
vector<int >mp2[100000];
int color[100000];
int out[100000];
int n,m,sig;
void Dfs(int u)
{
    vis[u]=1;
    for(int i=0;i<mp[u].size();i++)
    {
        int v=mp[u][i];
        if(vis[v]==0)Dfs(v);
    }
    num[sig++]=u;
}
void Dfs2(int u)
{
    vis[u]=1;
    color[u]=sig;
    for(int i=0;i<mp2[u].size();i++)
    {
        int v=mp2[u][i];
        if(vis[v]==0)
        {
            Dfs2(v);
        }
    }
}
void Kosaraju()
{
    sig=1;
    memset(out,0,sizeof(out));
    memset(color,0,sizeof(color));
    memset(vis,0,sizeof(vis));
    for(int i=1;i<=n;i++)
    {
        if(vis[i]==0)
        {
            Dfs(i);
        }
    }
    sig=0;
    memset(vis,0,sizeof(vis));
    for(int i=n;i>=1;i--)
    {
        if(vis[num[i]]==0)
        {
            sig++;
            Dfs2(num[i]);
        }
    }
    for(int i=1;i<=n;i++)
    {
        for(int j=0;j<mp[i].size();j++)
        {
            int u=i,v=mp[i][j];
            if(color[u]!=color[v])
            {
                out[color[u]]++;
            }
        }
    }
    int tot=0;
    for(int i=1;i<=sig;i++)
    {
        if(out[i]==0)
        {
            for(int j=1;j<=n;j++)
            {
                if(color[j]==i)
                {
                    ans[tot++]=j;
                }
            }
        }
    }
    sort(ans,ans+tot);
    for(int i=0;i<tot;i++)
    {
        if(i==0)printf("%d",ans[i]);
        else printf(" %d",ans[i]);
    }
    printf("\n");
}
int main()
{
    while(~scanf("%d",&n))
    {
        if(n==0)break;
        for(int i=1;i<=n;i++)
        {
            mp[i].clear();
            mp2[i].clear();
        }
        scanf("%d",&m);
        for(int i=0;i<m;i++)
        {
            int x,y;
            scanf("%d%d",&x,&y);
            mp[x].push_back(y);
            mp2[y].push_back(x);
        }
        Kosaraju();
    }
}