随笔分类 -  桥、割点

poj1523 SPF
摘要：SPF Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 9616 Accepted: 4334 Description Consider the two networks shown below. Assuming that da 阅读全文
posted @ 2017-12-15 19:38 zbtrs 阅读(231) 评论(0) 推荐(0) 编辑
poj3177 Redundant Paths
摘要：Redundant Paths Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 16630 Accepted: 6935 Description In order to get from one of the F (1 <= F 阅读全文
posted @ 2017-12-15 16:22 zbtrs 阅读(184) 评论(0) 推荐(0) 编辑
Hdu5215 Cycle
摘要：Cycle Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 955 Accepted Submission(s): 284 Problem D 阅读全文
posted @ 2017-12-13 14:49 zbtrs 阅读(219) 评论(0) 推荐(0) 编辑
poj2942 Knights of the Round Table
摘要：Knights of the Round Table Time Limit: 7000MS Memory Limit: 65536K Total Submissions: 13552 Accepted: 4538 Description Being a knight is a very attrac 阅读全文
posted @ 2017-09-15 11:30 zbtrs 阅读(287) 评论(0) 推荐(0) 编辑
poj3177 Redundant Paths
摘要：Redundant Paths Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 16108 Accepted: 6753 Description In order to get from one of the F (1 <= F 阅读全文
posted @ 2017-09-14 21:18 zbtrs 阅读(184) 评论(0) 推荐(0) 编辑
求割点与桥
摘要：在学习了刘汝佳大大的蓝书后有点体会，特来小结一下. 割点：对于无向图G，如果删除某个点u后，连通分量数目增加，称u为图的割点. 桥：对于无向图G，如果删除某条边(u,v)后，连通分量数目增加，称(u,v)为图的桥. 先说说怎么求割点吧，我们可以先想怎么暴力求解：把每一个点删除一次，然后dfs看连通分 阅读全文
posted @ 2017-08-21 11:51 zbtrs 阅读(311) 评论(0) 推荐(0) 编辑