poj 2553 The Bottom of a Graph 【有向图tarjan 求SCC 处理出度为0的SCC】



The Bottom of a Graph

Time Limit: 3000MS		Memory Limit: 65536K
Total Submissions: 9429		Accepted: 3910

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

定义：点v是汇点须满足 --- 对图中任意点u，若v可以到达u则必有u到v的路径；若v不可以到达u，则u到v的路径可有可无。

题意：在n个点m条边的有向图里面，问有多少个点是汇点。

分析：首先若SCC里面有一个点不是汇点，那么它们全不是汇点，反之也如此。这也就意味着一个SCC里面的点要么全是，要么全不是。在求出SCC并缩点后，任一个编号为A的SCC若存在指向编号为B的SCC的边，那么它里面所有点必不是汇点（因为编号为B的SCC不可能存在指向编号为A的SCC的边）。若编号为A的SCC没有到达其他SCC的路径，那么该SCC里面所有点必是汇点。因此判断的关键在于SCC的出度是否为0.

思路：先用tarjan求出所有SCC，然后缩点后找出所有出度为0的SCC，并用数字存储点，升序排列后输出。

AC代码：

#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
#include <stack>
#include <algorithm>
#define MAXN 5000
#define MAXM 25000000
#define INF 100000000
using namespace std;
struct Edge
{
	int from, to, next;
}edge[MAXM];
int head[MAXN], edgenum;
int low[MAXN], dfn[MAXN];
int dfs_clock;
int sccno[MAXN], scc_cnt;//sccno数组表示点属于哪个SCC  scc_cnt是SCC计数器 
vector<int> scc[MAXN];//存储SCC里面的点 
stack<int> S;
bool Instack[MAXN];
int in[MAXN], out[MAXN];//记录SCC的入度与出度 
int rec[MAXN];//记录满足条件的点数 
int n, m;//n个点  m条边 
void init()
{
	edgenum = 0;
	memset(head, -1, sizeof(head));
}
void addEdge(int u, int v)
{
	Edge E = {u, v, head[u]};
	edge[edgenum] = E;
	head[u] = edgenum++;
}
void getMap()
{
	int a, b;
	while(m--)
	{
		scanf("%d%d", &a, &b);
		addEdge(a, b);
	}
}
void tarjan(int u, int fa)
{
	int v;
	low[u] = dfn[u] = ++dfs_clock;
	S.push(u);
	Instack[u] = true;
	for(int i = head[u]; i != -1; i = edge[i].next)
	{
		v = edge[i].to;
		if(!dfn[v])
		{
			tarjan(v, u);
			low[u] = min(low[u], low[v]);
		}
		else if(Instack[v])
		low[u] = min(low[u], dfn[v]);
	}
	if(low[u] == dfn[u])
	{
		scc_cnt++;
		scc[scc_cnt].clear();
		for(;;)
		{
			v = S.top(); S.pop();
			Instack[v] = false;
			sccno[v] = scc_cnt;
			scc[scc_cnt].push_back(v);
			if(v == u) break; 
		}
	}
}
void find_cut(int l, int r)
{
	memset(low, 0, sizeof(low));
	memset(dfn, 0, sizeof(dfn));
	memset(sccno, 0, sizeof(sccno));
	memset(Instack, false, sizeof(Instack));
	dfs_clock = scc_cnt = 0;
	for(int i = l; i <= r; i++)
	if(!dfn[i]) tarjan(i, -1);
}
void suodian()//缩点 
{
	for(int i = 1; i <= scc_cnt; i++) in[i] = out[i] = 0;
	for(int i = 0; i < edgenum; i++)
	{
		int u = sccno[edge[i].from];
		int v = sccno[edge[i].to];
		if(u != v)
		in[v]++, out[u]++;
	}
}
void solve()
{
	int k = 0;//点数 
	for(int i = 1; i <= scc_cnt; i++)
	{
		if(out[i] == 0)//所有出度为0的SCC均满足 
		{
			for(int j = 0; j < scc[i].size(); j++) rec[k++] = scc[i][j]; 
		}
	}  
	sort(rec, rec+k);//升序排列 
	for(int i = 0; i < k; i++)
	{
		if(i > 0) printf(" ");
		printf("%d", rec[i]);
	}
	printf("\n");
}
int main()
{
	while(scanf("%d", &n), n)
	{
		scanf("%d", &m);
		init();
		getMap();
		find_cut(1, n);
		suodian();
		solve(); 
	}
	return 0;
}