一本通1516：消息的传递

最新推荐文章于 2024-09-17 20:29:16 发布

我是小蒟蒻

最新推荐文章于 2024-09-17 20:29:16 发布

阅读量358

点赞数 7

文章标签：图论算法 c++

本文链接：https://blog.csdn.net/liu12345635/article/details/136425275

版权

这篇文章展示了如何使用C++编写模板函数实现图的深度优先搜索和强连通分量计算，包括Tarjan算法的应用，以及统计每个强连通分量中的边的数量。

摘要由CSDN通过智能技术生成

#include <bits/stdc++.h>
template<typename T> inline void read(T &_x) {
    _x = 0;    //fast input
    T _w = 1, _ch = getchar();

    while (!isdigit(_ch) && _ch != '-')
        _ch = getchar();

    if (_ch == '-')
        _w = -1, _ch = getchar();

    while (isdigit(_ch))
        _x = (_x << 3) + (_x << 1) + (_ch^'0'), _ch = getchar();

    _x = _x * _w;
}
template<typename T> inline void write(T _x) {
    static char _q[65];
    int _cnt = 0;

    if (_x < 0)
        putchar('-'), _x = -_x;

    _q[++_cnt] = char(_x % 10), _x /= 10;

    while (_x)
        _q[++_cnt] = char(_x % 10), _x /= 10;

    while (_cnt)
        putchar(_q[_cnt--] + '0');
}
template <typename T> inline T min(const T a, const T b) {
    return a > b ? b : a;
}
template <typename T> inline T max(const T a, const T b) {
    return a > b ? a : b;
}
const int MAXM = 1e7 + 1145;
const int MAXN = 2e3 + 1145;
const int INF = 2147483647ll; //2^31-1
#define ll long long
#define pc putchar('\n')
#define pk putchar(' ')
/*---------------------------------pre------------------------------------*/
struct Edge {
    int u, v, val, nxt;
} edge[MAXM];
int head[MAXN], totr;
inline void add_edge(int u, int v, int val) {
    edge[++totr].nxt = head[u];
    edge[totr].u = u;
    edge[totr].v = v;
    edge[totr].val = val;
    head[u] = totr;
}
int n;
int low[MAXN], dfn[MAXN], dfs_num;
int vis[MAXN];
int num, scc[MAXN];
std::stack<int>sta;
void Tarjan(int u) {
    low[u] = dfn[u] = ++dfs_num;
    vis[u] = true;
    sta.push(u);

    for (int i = head[u]; i; i = edge[i].nxt)
#define v edge[i].v
        if (dfn[v] == 0)
            Tarjan(v), low[u] = min(low[v], low[u]);
        else if (vis[v] != 0)
            low[u] = min(low[u], dfn[v]);

#undef v

    if (dfn[u] == low[u]) {
        ++num;

        while (sta.top() != u) {
            scc[sta.top()] = num;
            vis[sta.top()] = false;
            sta.pop();
        }

        scc[sta.top()] = num;
        vis[sta.top()] = false;
        sta.pop();
    }
}
int rd[MAXN];
int tmp;
int main() {
    read(n);
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= n; j++) {
            read(tmp);

            if (tmp == 1)
                add_edge(i, j, 0);
        }

    for (int i = 1; i <= n; i++)
        if (dfn[i] == 0)
            Tarjan(i);

    for (int i = 1; i <= totr; i++)
        if (scc[edge[i].u] != scc[edge[i].v])
            rd[scc[edge[i].v]]++;

    int ans = 0;

    for (int i = 1; i <= num; i++)
        if (rd[i] == 0)
            ans++;

    write(ans);
    return 0;
}