题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1269
学习借鉴链接:https://blog.csdn.net/calculate23/article/details/89957376
这个题并没有要求输出强连通分量的顶点,如果需要的话,就可以
在这个地方进行操作
if (low[u] == dfn[u]) {//当退回到顶点时,输出强连通分量的顶点
while (true) {
int x = st.top();
st.pop();
vist[x] = false;
if (x == u) break;
}
}
总代码
#include <iostream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include<vector>
#include<stack>
using namespace std;
const int maxn = (int)1e4 + 5;
int n, m, tot;
bool vist[maxn];
int dfn[maxn], low[maxn];
vector<int> E[maxn];
stack<int> st;
void init() {//初始化并输入
for (int i = 1; i <= n; i++) {
E[i].clear();
}
memset(vist, false, sizeof(vist));
memset(dfn, 0, sizeof(dfn));
memset(low, 0, sizeof(low));
tot = 0;
while (!st.empty()) {
st.pop();
}
int u, v;
for (int i = 1; i <= m; i++) {
scanf("%d%d", &u, &v);
E[u].push_back(v);
}
}
void Tarjan(int u) {
dfn[u] = low[u] = ++tot;
st.push(u);//栈,记录遍历顺序
vist[u] = true; //u已经在栈中
for (int i = 0; i < E[u].size(); i++) {
int v = E[u][i];
if (!dfn[v]) {
Tarjan(v);
low[u] = min(low[u], low[v]);
}
else if (vist[v]) {
low[u] = min(low[u], dfn[v]);
}
}
if (low[u] == dfn[u]) {//当退回到顶点时,输出强连通分量的顶点
while (true) {
int x = st.top();
st.pop();
vist[x] = false;
if (x == u) break;
}
}
}
int main() {
while (scanf("%d%d", &n, &m) != EOF && n + m) {
init();
Tarjan(1);
bool flag = false;
for (int i = 1; i <= n; i++) {//如果有两个以上的强连通分量或者是没有强连通分量,进行标记
if (low[i] != 1) {
flag = true;
break;
}
}
if (flag) printf("No\n");
else printf("Yes\n");
}
return 0;
}