HDU ~ 1269 ~迷宫城堡 （强连通分量）

思路

tarjan模板题，直接上就好了，连通分量只有一个就是强连通图。

#include <bits/stdc++.h>
using namespace std;
const int MAXN = 1e5+5;
struct Edge
{
    int from, to;
    Edge (int from, int to): from(from), to(to) {}
};
struct SCC
{
    int n, m;
    int DFN[MAXN], LOW[MAXN], sccno[MAXN], dfs_clock, scc_cnt;
    vector<Edge> edges;
    vector<int> G[MAXN];
    stack<int> S;
    void init(int n)
    {
        this->n = n, m = 0;
        edges.clear();
        for (int i = 0; i <= n; i++) G[i].clear();
    }
    void AddEdge (int from, int to)
    { 
        edges.push_back(Edge(from, to));
        m = edges.size();
        G[from].push_back(m-1);
    }
    void dfs(int u)
    {
        DFN[u] = LOW[u] = ++dfs_clock;
        S.push(u);
        for (int i = 0; i < G[u].size(); i++)
        {
            Edge e = edges[G[u][i]];
            int v = e.to;
            if (!DFN[v])
            {
                dfs(v);
                LOW[u] = min(LOW[u], LOW[v]);
            }
            else if (!sccno[v])
                LOW[u] = min(LOW[u], DFN[v]);
        }
        if (LOW[u] == DFN[u])
        {
            scc_cnt++;
            while (1)
            {
                int x = S.top(); S.pop();
                sccno[x] = scc_cnt;
                if (x == u) break;
            }
        }
    }
    void find_scc()
    {
        dfs_clock = scc_cnt  = 0;
        memset(DFN, 0, sizeof(DFN)), memset(sccno, 0, sizeof(sccno));
        for (int i = 0; i < n; i++)
            if (!DFN[i]) dfs(i);
    }

}gao;

int n, m;
int main()
{
    while (~scanf("%d%d", &n, &m) && (n+m))
    {
        gao.init(n);
        while (m--)
        {
            int u, v; scanf("%d%d", &u, &v);
            u--, v--;
            gao.AddEdge(u, v);
        }
        gao.find_scc();
        if (gao.scc_cnt == 1) printf("Yes\n");
        else printf("No\n");
    }
    return 0;
}
/*
3 3
1 2
2 3
3 1
3 3
1 2
2 3
3 2
0 0
*/