Tarjin算法——找连通分量

hahaAll

于 2015-12-18 16:21:25 发布

阅读量1.5k

点赞数

本文链接：https://blog.csdn.net/hahaAll/article/details/50352528

版权

Tarjin算法是一种用于查找有向图连通分量的高效算法，同时也适用于处理无向图的割和桥问题。其时间复杂度为O(N+M)，其中N是节点数，M是边数。在HDU3836题目中，该算法被用于求解有向图的连通分量。通过使用Tarjin算法将连通分量合并，然后计算每个点的出度和入度，如果发现出度或入度为零的点，需要添加边。最终，比较这些附加边的最大值，即可得到答案。这个问题的解决方案可以从这篇博客中获取：http://blog.csdn.net/maiyuetong/article/details/6609824。

摘要由CSDN通过智能技术生成

Tarjin算法可以实现找有向图的连通分量，无向图的割和桥以及最近公共祖先。

Tarjin算法的时间复杂度为O（N+M）；

hdu3836就是利用Tarjin算法可以找有向图的连通分量：http://acm.hdu.edu.cn/showproblem.php?pid=3836

Equivalent Sets

Time Limit: 12000/4000 MS (Java/Others) Memory Limit: 104857/104857 K (Java/Others)
Total Submission(s): 3638 Accepted Submission(s): 1273

Problem Description

To prove two sets A and B are equivalent, we can first prove A is a subset of B, and then prove B is a subset of A, so finally we got that these two sets are equivalent.
You are to prove N sets are equivalent, using the method above: in each step you can prove a set X is a subset of another set Y, and there are also some sets that are already proven to be subsets of some other sets.
Now you want to know the minimum steps needed