![](https://img-blog.csdnimg.cn/20201014180756918.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
图论
菜鸟求巨巨带飞
这个作者很懒,什么都没留下…
展开
-
两种代码风格解决强连通分量解决加多少条边使整个图连通&多少个点可以到达所有点
使用Tarjan进行缩点,得到一个SCC图、 这个图有多少个入度为0的,多少个出度为0的。假设有n个入度为0,m个出度为0那么需要给n个点才能传遍所有点,需要加max(n,m)条边才能使整个图变成强连通分量#include<cstdio> #include<cstring> #include<iostream> #include<algorithm> #include<queue> #includ原创 2016-07-18 20:34:26 · 493 阅读 · 0 评论 -
hdu3849 Tarjan求无向图的割边+map
#include<cstdio> #include<cstring> #include<iostream> #include<algorithm> #include<queue> #include<map> #include<vector> #include<set> #include<stack> #include<string>//#include<bits/stdc++.h> using na原创 2016-07-19 14:35:51 · 279 阅读 · 0 评论 -
Codeforces 14D 求树的直径(网上大多数是DFS于是自己写了个BFS)
转载请说明出处:D. Two Pathstime limit per test2 secondsmemory limit per test64 megabytesinputstandard inputoutputstandard outputAs you know, Bob’s brother lives in Flatland. In Flatland there are n cities, co原创 2016-07-30 17:14:16 · 304 阅读 · 0 评论 -
HDU 4183 最大流模板题
Pahom on WaterTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 971 Accepted Submission(s): 443Problem Description Pahom on Water is an interact原创 2016-08-03 09:32:14 · 332 阅读 · 0 评论 -
HDU 3435 KM算法或者最小费用最大流
A new Graph Game Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1010 Accepted Submission(s): 454 Problem Description An undirec原创 2016-08-03 20:27:04 · 538 阅读 · 0 评论 -
Tarjan求图的连通性总结
有向图的Tarjan&缩点 void tarjan(int x){ //Tarjan int y = 0; dfn[x]=low[x]=++dindex; instack[x]=true; stap[++stop]=x; for (int i=0; i<e[x].size(); i++) {原创 2016-07-21 16:20:29 · 352 阅读 · 0 评论