![](https://img-blog.csdnimg.cn/20201014180756916.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
tarjan
文章平均质量分 89
XTU_wcb
这个作者很懒,什么都没留下…
展开
-
POJ3352-Road Construction
转载自:優YoU http://blog.csdn.net/lyy289065406/article/details/6762370大致题意:某个企业想把一个热带天堂岛变成旅游胜地,岛上有N个旅游景点,任意2个旅游景点之间有路径连通(注意不一定是直接连通)。而为了给游客提供更方便的服务,该企业要求道路部门在某些道路增加一些设施。道路部门每次只会选择一条道路施工,在该条道转载 2014-08-21 22:39:24 · 287 阅读 · 0 评论 -
UVA1108 HDU3844 Mining Your Own Business
Mining Your Own BusinessTime Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1583 Accepted Submission(s): 255Problem DescriptionJohn D原创 2015-03-21 09:45:50 · 640 阅读 · 0 评论 -
UVA 11324 The Largest Clique
Problem B: The Largest CliqueGiven a directed graph G, consider the following transformation. First, create a new graphT(G) to have the same vertex set asG. Create a directed edge betweentwo ver原创 2015-03-21 10:59:38 · 345 阅读 · 0 评论 -
求割点/割边/强连通分量/双连通分量/LCA(最近公共祖先)
如果在图G中去掉一个顶点(自然同时去掉与该顶点相关联的所有边)后,该图的连通分支数增加,则称该顶点为G的割点(cut-vertex)。原创 2014-07-31 19:49:18 · 549 阅读 · 0 评论