题目链接
http://acm.hdu.edu.cn/showproblem.php?pid=3594
题意
仙人掌图必须满足的条件:
1.强连通图
2.每条边只属于一个环
给定一图判断是否为仙人掌图
思路
翻译成tarjan算法里的条件:
1.不能存在横向边
2.dfs树中所有边(u->v)v是u的子节点,需满足:low[v]>=dfn[u]
3.dfs树中所有边(u->v)v是u的子节点,需满足:u的逆向边+u的所有子节点Low值小于dfn[u]的点<2
分析:https://wenku.baidu.com/view/ce296043192e45361066f575.html
#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<vector>
#include<string>
#include<queue>
#include<stack>
#include<set>
#include<map>
#define ll long long
using namespace std;
const int INF = ( 2e9 ) + 2;
const ll maxn = 2e4+10;
vector<int> g[maxn];
int dfn[maxn],low[maxn],Stack[maxn];
bool Instack[maxn],vis[maxn];
int scc,top,index;
bool ok;
void tarjan(int u)
{
dfn[u]=low[u]=++index;
Stack[top++]=u;
Instack[u]=1;
int cnt=0;
for(int i=0,L=g[u].size();i<L;i++)
{
int v=g[u][i];
if(vis[v])ok=false;
if(!dfn[v])
{
tarjan(v);
if(low[v]>dfn[u])ok=false;
if(cnt==2)ok=false;
low[u]=min(low[u],low[v]);
}
else if(Instack[v])
{
low[u]=min(low[u],dfn[v]);
cnt++;
if(cnt==2)ok=false;
}
}
if(dfn[u]==low[u])
{
scc++;
int x;
do
{
x=Stack[--top];
Instack[x]=false;
}while(x!=u);
}
vis[u]=1;
}
int main()
{
int T;
scanf("%d",&T);
while(T--)
{
int n;
scanf("%d",&n);
for(int i=0;i<=n;i++)g[i].clear();
int u,v;
u=v=1;
while(1)
{
scanf("%d%d",&u,&v);
if(u+v==0)break;
g[u].push_back(v);
}
memset(dfn,0,sizeof(dfn));
memset(vis,0,sizeof(vis));
scc=top=index=0;
ok=true;
for(int i=0;i<n;i++)
if(!dfn[i])
tarjan(i);
printf("%s\n",(ok&&scc==1)?"YES":"NO");
}
}