![](https://img-blog.csdnimg.cn/20201014180756724.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
__强连通分量
BigZong
这个作者很懒,什么都没留下…
展开
-
[思考]无向连通图的个数
做了一些连通图的专题,发现在题目中的特殊情况下需要判断当前连通图是一个还是多个,而既然提出了这个问题,就说明在有的问题中需要考虑这种情况。拿HDU4738为例,这道题中,如果是给定边组成了一个连通图的话输出为-1,反之再进行其他的判断。因为是需要求桥,所以在直接使用Tarjan算法了。使用Tarjan算法的时候会有这样一个思考,题中有没有说给定的边构成一个图,如果是的话,你有没有直接写...原创 2019-12-10 19:47:44 · 1222 阅读 · 0 评论 -
Caocao's Bridges HDU - 4738(Tarjan求最小权值桥值)
Problem DescriptionCaocao 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....原创 2019-12-10 19:39:25 · 174 阅读 · 0 评论 -
Strongly connected HDU - 4635 (有向图强连通分量 DAG)
Problem DescriptionGive a simple directed graph with N nodes and M edges. Please tell me the maximum number of the edges you can add that the graph is still a simple directed graph. Also, after you...原创 2019-12-10 11:07:09 · 116 阅读 · 0 评论 -
HDU4612——Warm up(Tarjan求桥+缩点+求直径)
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...原创 2019-12-07 11:08:11 · 133 阅读 · 0 评论 -
对于“关于有重边图的双连通分量”引发的思考
红字部分内容转载自:https://blog.csdn.net/gyarenas/article/details/8712338博主允许转载,故以此博客为基础浅谈自己对于重边的理解。何为重边?顾名思义,对于两个顶点A和B,有不止一条边从A连接到B。在学习生成树的时候我们知道,树本身不能构成回路,那么对于A到B与A到B这一对重边,对于我们求解其实是没有影响的。也就是说:有向图的...原创 2019-12-07 10:55:39 · 746 阅读 · 0 评论