随笔分类 -  连通图

POJ 3177 Redundant Paths（无向图缩点）
摘要：Description：In order to get from one of the F (1 2 and 1 –> 6 –> 5 –> 21 – 4: 1 –> 2 –> 3 –> 4 and 1 –> 6 –> 5 –> 43 – 7: 3 –> 4 –> 7 and 3 –> 2 –> 5... 阅读全文
posted @ 2015-08-19 10:23 搁浅の记忆 阅读(168) 评论(0) 推荐(0)
POJ 3694 Network（无向图求桥的个数，有重边）
摘要：Description：A network administrator manages a large network. The network consists of N computers and M links between pairs of computers. Any pair of c... 阅读全文
posted @ 2015-08-07 10:20 搁浅の记忆 阅读(286) 评论(0) 推荐(0)
POJ 1236 Network of Schools(强连通分量缩点求根节点和叶子节点的个数)
摘要：Description：A number of schools are connected to a computer network. Agreements have been developed among those schools: each school maintains a list ... 阅读全文
posted @ 2015-08-06 17:33 搁浅の记忆 阅读(195) 评论(0) 推荐(0)
UVA 796 Critical Links(无向图求桥)
摘要：题目来源：UVa Online Judgehttps://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=737求一个连通图中必不可少的路径：#include#includ... 阅读全文
posted @ 2015-08-06 09:12 搁浅の记忆 阅读(159) 评论(0) 推荐(0)
UVA 315 Network（无向图求割点）
摘要：Description:A Telephone Line Company (TLC) is establishing a new telephone cable network. They are connecting several places numbered by integers from... 阅读全文
posted @ 2015-08-05 16:21 搁浅の记忆 阅读(156) 评论(0) 推荐(0)
HDU 1269 迷宫城堡（求是否只有一个强连通分量）
摘要：Problem Description：为了训练小希的方向感，Gardon建立了一座大城堡，里面有N个房间(N#include#include#include#define N 10010using namespace std;int dfn[N], low[N]; //dfn数组表示遍历至该点的时... 阅读全文
posted @ 2015-08-05 14:56 搁浅の记忆 阅读(173) 评论(0) 推荐(0)