HDU - 3594
Description
1. It is a Strongly Connected graph.
2. Each edge of the graph belongs to a circle and only belongs to one circle. We call this graph as CACTUS. There is an example as the figure above. The left one is a cactus, but the right one isn’t. Because the edge (0, 1) in the right graph belongs to two circles as (0, 1, 3) and (0, 1, 2, 3). Input
The input consists of several test cases. The first line contains an integer T (1<=T<=10), representing the number of test cases.
For each case, the first line contains a integer n (1<=n<=20000), representing the number of points. The following lines, each line has two numbers a and b, representing a single-way edge (a->b). Each case ends with (0 0). Notice: The total number of edges does not exceed 50000. Output
For each case, output a line contains “YES” or “NO”, representing whether this graph is a cactus or not.
Sample Input
Sample Output
Hint Source
2010 ACM-ICPC Multi-University Training Contest(16)――Host by NUDT
判断是仙人掌图的条件:
1.是强连通图;
2.不存在一条边在多个环中。
思路: 条件1 只需判断只有一个连通分量即可; 条件2 判断是否low[v] != dfn[v]。
AC代码:
|
HDU 3594
最新推荐文章于 2019-12-18 20:09:00 发布