POJ 1966--Cable TV Network 【求无向图的点连通度构造最大流模型 && dinic】

最新推荐文章于 2018-10-10 00:01:00 发布

阿阿阿阿_欢

最新推荐文章于 2018-10-10 00:01:00 发布

阅读量1k

点赞数 1

分类专栏： POJ 双联通分量网络流

本文链接：https://blog.csdn.net/hpuhjh/article/details/47453453

版权

本文介绍了如何利用网络流模型和Dinic算法来求解无向图的点连通度问题。通过构建特殊网络，将原图的顶点和边映射到新的网络中，然后寻找最小的最大流来确定图的连通度。对于有向图，也有类似的方法。同时，文章还提及了边连通度的计算方法，强调在枚举过程中需要正确处理最大流和边流量的清零操作。

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

Cable TV Network

Time Limit: 1000MS		Memory Limit: 30000K
Total Submissions: 4234		Accepted: 1989

Description

The interconnection of the relays in a cable TV network is bi-directional. The network is connected if there is at least one interconnection path between each pair of relays present in the network. Otherwise the network is disconnected. An empty network or a network with a single relay is considered connected. The safety factor f of a network with n relays is:
1. n, if the net remains connected regardless the number of relays removed from the net.
2. The minimal number of relays that disconnect the network when removed.

For example, consider the nets from figure 1, where the circles mark the relays and the solid lines correspond to interconnection cables. The network (a) is connected regardless the number of relays that are removed and, according to rule (1), f=n=3. The network (b) is disconnected when 0 relays are removed, hence f=0 by rule (2). The network (c) i