![](https://img-blog.csdnimg.cn/20201014180756930.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
双连通分量
文章平均质量分 80
笑着走完自己的路
这个作者很懒,什么都没留下…
展开
-
hdoj 4738 Caocao's Bridges 【无向图边-双联通 求所有桥中权值最小的】
Caocao's BridgesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1998 Accepted Submission(s): 713Problem DescriptionCaocao w原创 2015-07-09 17:11:40 · 584 阅读 · 0 评论 -
lightoj 1026 - Critical Links 【DFS求块 + 边双连通求桥】
1026 - Critical LinksPDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBIn a computer network a link L, which interconnects two serve原创 2015-11-18 21:03:04 · 681 阅读 · 0 评论 -
hdoj 3849 By Recognizing These Guys, We Find Social Networks Useful 【无向图求桥】
By Recognizing These Guys, We Find Social Networks UsefulTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 125536/65536 K (Java/Others)Total Submission(s): 2842 Accepted Submission(s): 70原创 2015-09-06 14:03:56 · 544 阅读 · 0 评论 -
hdoj 4612 Warm up 【无向图边双连通求桥数 缩点后求树的直径 桥数-树的直径】
Warm upTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 4569 Accepted Submission(s): 1031Problem Description N planets are con原创 2015-07-16 12:58:51 · 625 阅读 · 0 评论 -
无向图 点连通tarjan算法 求割点 + 求BCC以及BCC里面的点 + 求去掉每个点后图中BCC数目 【总结】
看了好久,终于把点——双联通看懂了。题目:给定一个有N个点M条边组成的无向图,求无向图中的割点以及去掉该点后分成的BCC数目,若不存在割点输出No SPF nodes。思路:tarjan算法:用low[]表示从该点或它的子孙出发 通过回边可以到达的最低深度优先数 更新low[u]有三点:均在tarjan中实现1,u本身的深度优先数dfn[u]2,u的子女中最原创 2015-07-09 11:57:51 · 1942 阅读 · 0 评论 -
poj 1532 【求无向图的所有割点 以及 该点分成的BCC数目】
SPFTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 6921 Accepted: 3160DescriptionConsider the two networks shown below. Assuming that data moves a原创 2015-07-08 15:34:57 · 1007 阅读 · 0 评论 -
poj 2117 Electricity 【无向图求割点】【求去掉一个点后 图中最多的BCC数目】
ElectricityTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 4597 Accepted: 1515DescriptionBlackouts and Dark Nights (also known as ACM++) is a company th原创 2015-08-18 20:45:55 · 1013 阅读 · 0 评论 -
hdoj 2242 考研路茫茫——空调教室 【无向图求边双联通 缩点 + 树形dp】
考研路茫茫——空调教室Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2447 Accepted Submission(s): 721Problem Description众所周知,HDU的考研教室原创 2015-08-14 00:47:21 · 1463 阅读 · 0 评论 -
无向图 边双联通 求桥 + 求 EBC + 缩点 模版 (EBC表示边-双连通分量)
引子:对N个点和M条边 的求桥 以及 缩点处理。 模版: #include #include #include #include #include #include #define MAXN 200000+10 #define MAXM 2000000+10 #define INF 100000000using namespace std;原创 2015-07-16 13:28:53 · 660 阅读 · 0 评论 -
poj 3177 Redundant Paths 【无向图增加最少的边是图成为边—双连通】【tarjan求EBC + 缩点 统计度数为1的EBC】
Redundant PathsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10494 Accepted: 4503DescriptionIn order to get from one of the F (1 <= F <= 5,000) graz原创 2015-07-20 23:38:27 · 600 阅读 · 0 评论 -
poj 2942 Knights of the Round Table 【无向图求BCC + 黑白染色判断二分图】
Knights of the Round TableTime Limit: 7000MS Memory Limit: 65536KTotal Submissions: 10700 Accepted: 3527DescriptionBeing a knight is a very attractive career: searc原创 2015-07-16 22:05:46 · 729 阅读 · 0 评论 -
poj 1515 Street Directions 【tarjan 求割边】【确定无向图边的方向 将其变成有向强连通图】
Street DirectionsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 753 Accepted: 408 Special JudgeDescriptionAccording to the Automobile Collision Mon原创 2015-08-10 12:49:29 · 1217 阅读 · 0 评论 -
hdoj 3844 Mining Your Own Business 【在无向图选择尽量少的点涂黑,使得任意删除一个点后每个BCC里面至少有一个点涂黑】
Mining Your Own BusinessTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1701 Accepted Submission(s): 271Problem DescriptionJohn原创 2015-07-17 09:48:45 · 749 阅读 · 0 评论 -
poj 1144 Network 【求无向图中割点总数】【点双联通入门题目】
NetworkTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 10441 Accepted: 4850DescriptionA Telephone Line Company (TLC) is establishing a new telephone c原创 2015-07-08 16:31:44 · 562 阅读 · 0 评论 -
zoj 2588 Burning Bridges【无向图求桥 并输出桥对应边的序号】
Burning BridgesTime Limit: 5 Seconds Memory Limit: 32768 KB Ferry Kingdom is a nice little country located on N islands that are connected by M bridges. All bridges are very beautif原创 2015-07-10 17:02:50 · 499 阅读 · 0 评论 -
Codeforces 652E Pursuit For Artifacts 【边双连通 缩点】
题目链接:Codeforces 652E Pursuit For ArtifactsE. Pursuit For Artifacts time limit per test3 seconds memory limit per test512 megabytes inputstandard input outputstandard output Johnny is playing a原创 2016-03-29 12:11:24 · 935 阅读 · 0 评论