![](https://img-blog.csdnimg.cn/20201014180756757.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
【图的连通】
文章平均质量分 85
Gijkstra
Can we do better?
展开
-
POJ3177 Redundant Paths(边双连通分量)
Redundant Paths Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 16783 Accepted: 6998 Description In order to get from one of the F (1 <= F <= 5,000) graz原创 2018-01-23 09:16:52 · 295 阅读 · 0 评论 -
POJ1144 Network(求割边)
题目链接:Network 题意:给出一个无向图,求有多少个割边,并按字典序输出 算是个求割边模板题,不过还要求字典序 #include #include #include #include #include #define mem(a,b) memset(a,b,sizeof(a)) using namespace std; const int N=10010; const int M=原创 2018-01-23 09:09:52 · 247 阅读 · 0 评论 -
HDU4612 Warm up(割边+树的直径)
Warm up Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others) Total Submission(s): 7504 Accepted Submission(s): 1747 Problem Description N planets are c原创 2018-01-23 09:42:48 · 191 阅读 · 0 评论 -
HDU4635 Strongly connected(tarjan缩点+思路)
Strongly connected Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3476 Accepted Submission(s): 1402 Problem Description Give a原创 2018-01-23 10:11:57 · 188 阅读 · 0 评论 -
POJ3694 Network (缩点+并查集+LCA)
Network Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 10825 Accepted: 4043 Description A network administrator manages a large network. The network con原创 2018-01-26 15:47:29 · 240 阅读 · 0 评论