双联通分量
文章平均质量分 90
阿阿阿阿_欢
勿忘初心
展开
-
POJ 1966--Cable TV Network 【求无向图的点连通度 构造最大流模型 && dinic】
Cable TV NetworkTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 4234 Accepted: 1989DescriptionThe interconnection of the relays in a cable TV network原创 2015-08-12 23:15:41 · 999 阅读 · 0 评论 -
HDU 4612--Warm up 【无向图边双连通求桥数 && 缩点后重建图求树的直径】
Warm upTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)Total Submission(s): 4830 Accepted Submission(s): 1086Problem Description N planets are conne原创 2015-08-18 21:27:13 · 664 阅读 · 0 评论 -
POJ 2117--Electricity【点双联通 && 求删去一个点后,图最多有多少块连通】
ElectricityTime Limit: 5000MS Memory Limit: 65536KTotal Submissions: 4589 Accepted: 1512DescriptionBlackouts and Dark Nights (also known as ACM++) is a company原创 2015-08-18 10:54:38 · 1249 阅读 · 0 评论 -
POJ 1144--Network 【无向图中割点总数】
NetworkTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 10764 Accepted: 4978DescriptionA Telephone Line Company (TLC) is establishing a new telephone c原创 2015-08-12 17:56:01 · 624 阅读 · 0 评论 -
POJ 1523--SPF【无向图的所有割点 && 删去该点后bcc的数目】
SPFTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 7066 Accepted: 3218DescriptionConsider the two networks shown below. Assuming that data moves around原创 2015-08-12 17:05:56 · 1103 阅读 · 0 评论 -
POJ 3352--Road Construction【无向图增加最少的边成为边双连通图 && tarjan求ebc && 缩点构造缩点树】
Road ConstructionTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 9986 Accepted: 4952DescriptionIt's almost summer time, and that means that it's almos原创 2015-08-18 16:40:26 · 746 阅读 · 0 评论 -
POJ 3177--Redundant Paths【无向图增加最少的边成为边双连通图 && tarjan求ebc && 缩点构造缩点树】
Redundant PathsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10798 Accepted: 4626DescriptionIn order to get from one of the F (1 <= F <= 5,000) graz原创 2015-08-18 15:13:58 · 1128 阅读 · 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 beautiful原创 2015-08-15 18:58:58 · 746 阅读 · 0 评论 -
HDU 4738 --Caocao's Bridges 【无向图边双联通 && 求权值最小的桥 && 模板】
Caocao's BridgesTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2641 Accepted Submission(s): 855Problem DescriptionCaocao was def原创 2015-08-15 17:51:05 · 930 阅读 · 0 评论 -
HDU 3849--By Recognizing These Guys, We Find Social Networks Useful【边双联通 && 求桥的数目 && 输出桥】
题意:给你一个N个点(这里用字符串表示的)和M条边的无向图,让你求出桥数并输出所有的桥。解析:基本的边双联通问题,主要是点的处理有点复杂,还有注意可能有重边,要处理一下。原创 2015-09-24 22:28:31 · 371 阅读 · 0 评论