https://blog.haitai-social.com/note/%E7%B3%BB%E7%BB%9F%E7%90%86%E8%AE%BA%E8%AF%BE%E7%A8%8B/oi-wiki/%E5%9B%BE%E8%AE%BA/Recent content in 图论 on 蛇索尼 AidenHugo -- gohugo.iozh-CNshesl-meow@qq.com (佘崧林)shesl-meow@qq.com (佘崧林)Sun, 18 Jul 2021 12:36:31 +0800https://blog.haitai-social.com/note/%E7%B3%BB%E7%BB%9F%E7%90%86%E8%AE%BA%E8%AF%BE%E7%A8%8B/oi-wiki/%E5%9B%BE%E8%AE%BA/tarjan/Sun, 18 Jul 2021 12:36:31 +0800shesl-meow@qq.com (佘崧林)https://blog.haitai-social.com/note/%E7%B3%BB%E7%BB%9F%E7%90%86%E8%AE%BA%E8%AF%BE%E7%A8%8B/oi-wiki/%E5%9B%BE%E8%AE%BA/tarjan/Tarjan 实现 Tarjan’s algorithm 是一个用于求解无向图割点与桥的算法。直接上代码： 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 void tarjan(int u, int v) { /* compute dfn and low while performing a dfs search - beginning at vertex u, v is the