图论--割点与桥
二喵君
菜的不安详
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
LightOJ 1026 Critical Links【桥】
参看资料:https://blog.youkuaiyun.com/zyz_3_14159/article/details/52823070题目:In a computer network a link L, which interconnects two servers, is considered critical if there are at least two servers A and...原创 2019-01-23 23:03:44 · 230 阅读 · 0 评论 -
图的搜索树
参看资料:http://www.gonglin91.com/dfs-graph-edge/http://www.cnblogs.com/bofengyu/p/5003049.html是:在图的遍历过程中的形成的一棵树。先明确几个概念:树边,前向边,后向边,横叉边 树边,前向边,后向边,横叉边,应该说,不是一个图本身有的概念,应该是图进行DFS时才有的概念。图进行DF...原创 2019-01-15 10:25:43 · 1337 阅读 · 0 评论 -
割点【模板】
参看资料:https://www.cnblogs.com/maple-kingdom/p/maple-kingdom_wind.htmlhttps://www.cnblogs.com/collectionne/p/6847240.htmlhttps://baike.baidu.com/item/%E5%89%B2%E7%82%B9/9384042?fr=aladdin割点集合&am...原创 2019-02-22 10:28:41 · 708 阅读 · 0 评论 -
POJ 1144 Network【割点】
题目:A Telephone Line Company (TLC) is establishing a new telephone cable network. They are connecting several places numbered by integers from 1 to N. No two places have the same number. The lines a...原创 2019-02-22 14:21:36 · 166 阅读 · 0 评论 -
UVA 796 Critical Links【求桥】
题目:Description:In a computer network a link L, which interconnects two servers, is considered critical if there are at least two servers A and B such that all network interconnection paths betwee...原创 2019-02-22 15:51:59 · 321 阅读 · 0 评论 -
Tarjan算法&&求强连通分量
搞懂了一直搞不懂的地方,趁着热乎赶紧记下来。参看资料:https://blog.youkuaiyun.com/qq_34374664/article/details/77488976https://blog.youkuaiyun.com/jeryjeryjery/article/details/52829142?locationNum=4&fps=1https://blog.youkuaiyun.com/qq...原创 2019-02-23 10:31:48 · 244 阅读 · 0 评论
分享