
双连通分量
UCAS王小二
不念过去,不畏未来...
展开
-
POJ 1144 Network 【求割点总数】
DescriptionA 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...原创 2018-02-22 20:38:55 · 233 阅读 · 0 评论 -
POJ 1523 SPF【求割点及其BCC数目】
Consider the two networks shown below. Assuming that data moves around these networks only between directly connected nodes on a peer-to-peer basis, a failure of a single node, 3, in the network on th...原创 2018-02-22 21:02:44 · 295 阅读 · 0 评论 -
HDU 4738 Caocao's Bridges【边双联通--权值最小+重边】
Caocao was defeated by Zhuge Liang and Zhou Yu in the battle of Chibi. But he wouldn’t give up. Caocao’s army still was not good at water battles, so he came up with another idea. He built many island...原创 2018-02-22 23:29:01 · 206 阅读 · 0 评论 -
ZOJ 2588 Burning Bridges【无向图求桥并输出对应编号+map处理重边】
Ferry Kingdom is a nice little country located on N islands that are connected by M bridges. All bridges are very beautiful and are loved by everyone in the kingdom. Of course, the system of bridges i...原创 2018-02-23 17:26:22 · 396 阅读 · 0 评论 -
强连通分量+双连通分量【模板】
求桥+割点+连通块+map重边:#include <cstdio>#include <cstring>#include <algorithm>#include <cmath>#include <map>#include <vector>using namespace std;typedef long lo...原创 2018-02-23 18:07:46 · 319 阅读 · 0 评论 -
HDU 4612 Warm up【双连通缩点(BCC去重边)+染色建新图+树的直径】
Problem Description N planets are connected by M bidirectional channels that allow instant transportation. It’s always possible to travel between any two planets through these channels. If we ca...原创 2018-02-24 15:30:06 · 233 阅读 · 0 评论