2013年7月11日

POJ 3177 Redundant Paths POJ 3352 Road Construction

摘要: 这两题是一样的,代码完全一样。就是给了一个连通图,问加多少条边可以变成边双连通。去掉桥,其余的连通分支就是边双连通分支了。一个有桥的连通图要变成边双连通图的话,把双连通子图收缩为一个点,形成一颗树。需要加的边为(leaf+1)/2 (leaf为叶子结点个数)POJ 3177 给定一个连通的无向图G,至少要添加几条边,才能使其变为双连通图。参考:http://blog.csdn.net/lyy289065406/article/details/6762432http://www.cnblogs.com/kuangbin/p/3184889.html#include #include #inclu 阅读全文

posted @ 2013-07-11 19:13 kuangbin 阅读(529) 评论(0) 推荐(0) 编辑

【转】图的割点、桥与双连通分支

摘要: 原文地址:https://www.byvoid.com/blog/biconnect图的割点、桥与双连通分支[点连通度与边连通度]在一个无向连通图中,如果有一个顶点集合,删除这个顶点集合,以及这个集合中所有顶点相关联的边以后,原图变成多个连通块,就称这个点集为割点集合。一个图的点连通度的定义为,最小割点集合中的顶点数。类似的,如果有一个边集合,删除这个边集合以后,原图变成多个连通块,就称这个点集为割边集合。一个图的边连通度的定义为,最小割边集合中的边数。[双连通图、割点与桥]如果一个无向连通图的点连通度大于1,则称该图是点双连通的(point biconnected),简称双连通或重连通。一个 阅读全文

posted @ 2013-07-11 19:12 kuangbin 阅读(1397) 评论(0) 推荐(0) 编辑

POJ 3694 Network (求桥,边双连通分支缩点,lca)

摘要: NetworkTime Limit:5000MSMemory Limit:65536KTotal Submissions:5619Accepted:1939DescriptionA network administrator manages a large network. The network consists of N computers and M links between pairs of computers. Any pair of computers are connected directly or indirectly by successive links, so dat 阅读全文

posted @ 2013-07-11 19:06 kuangbin 阅读(1548) 评论(0) 推荐(0) 编辑

UVA 796 - Critical Links (求桥)

摘要: Critical LinksIn 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 between A and B pass through L. Removing a critical link generates two disjoint sub-networks such that any two s 阅读全文

posted @ 2013-07-11 15:42 kuangbin 阅读(1492) 评论(0) 推荐(0) 编辑

UVA 315 315 - Network(求割点个数)

摘要: NetworkA Telephone Line Company (TLC) is establishing a new telephone cable network. They are connecting several places numbered by integers from 1 toN. No two places have the same number. The lines are bidirectional and always connect together two places and in each place the lines end in a telepho 阅读全文

posted @ 2013-07-11 15:40 kuangbin 阅读(2368) 评论(0) 推荐(0) 编辑

导航

JAVASCRIPT: