![](https://img-blog.csdnimg.cn/20201014180756930.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
连通图
浮生一朝
这个作者很懒,什么都没留下…
展开
-
Network of Schools POJ - 1236(tarjan+缩点)
题目链接 题意:题目大意:有N个学校,从每个学校都能从一个单向网络到另外一个学校,初始至少需要向多少个学校发放软件,使得网络内所有的学校最终都能得到软件。至少需要添加几条边,使任意向一个学校发放软件后,经过若干次传送,网络内所有的学校最终都能得到软件。 解题思路:首先找连通分量,然后看连通分量的入度为0点的总数,出度为0点的总数,那么问要向多少学校发放软件,就是入度为零的个数,这样才能保证所有...原创 2018-02-08 20:45:28 · 170 阅读 · 0 评论 -
Network UVA - 315(求割点,)
A Telephone Line Company (TLC) is establishing a new telephone cable network. They are connecting several places numbered by integers from 1 to N . No two places have the same number. The lines ar原创 2018-02-07 12:08:52 · 269 阅读 · 0 评论 -
Strongly connected HDU - 4635(Tarjan+缩点)
Give 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 add these edges, this原创 2018-02-07 17:43:34 · 193 阅读 · 0 评论