摘要:tarjan 求 无向图的割边 (桥) 边 (x,y) 是桥当且仅当, 对于 x 的子节点 y ,low[x] include include include include include pragma comment(linker, "/STACK:16777216") include usin 阅读全文
posted @ 2018-04-02 15:01 Mr_Wolfram 阅读 (56) 评论 (0) 编辑
摘要:tarjan 求无向图的割点 割点,即割去此点后原图可变为两个或多个独立的联通块 一个点 x 是割点,当且仅当存在一个x 的子节点 y ,使得 low[y] = dfn[x] 对于根节点来说,需要两个满足的节点 cpp include include include include include 阅读全文
posted @ 2018-04-02 10:44 Mr_Wolfram 阅读 (80) 评论 (0) 编辑