Java实现冗余路径Redundant Paths

最新推荐文章于 2022-10-03 09:21:05 发布

南墙

最新推荐文章于 2022-10-03 09:21:05 发布

阅读量1.1w

点赞数 18

分类专栏：算法练习题文章标签： Java 冗余路径Redundant Paths 冗余路径 Redundant Paths 边连通分量

本文链接：https://blog.csdn.net/a1439775520/article/details/97401584

版权

这篇博客探讨了如何使用Java解决寻找冗余路径的问题。在奶牛试图避免经过腐烂苹果树的场景下，需要构建额外的路径确保任意两放牧区间至少存在两条独立路径。现有每对字段间至少一条路，目标是找到最小数量的新路径以达到目标。输入包括字段数量和现有路径描述，输出是所需新建路径的数量。

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

Description

In order to get from one of the F (1 <= F <= 5,000) grazing fields (which are numbered 1..F) to another field, Bessie and the rest of the herd are forced to cross near the Tree of Rotten Apples. The cows are now tired of often being forced to take a particular path and want to build some new paths so that they will always have a choice of at least two separate routes between any pair of fields. They currently have at least one route between each pair of fields and want to have at least two. Of course, they can only travel on Official Paths when they move from one field to another. 

Given a description of the current set of R (F-1 <= R <= 10,000) paths that each connect exactly two different fields, determine the minimum number of new paths (each of which connects exactly two fields) that must be built so that there are at least two separate routes between any pair of fields. Routes are considered separate if they use none of the same paths, even if they visit the same intermediate field along the way. 

There might already be more than one paths between the same pair of fields, and you may also build a new path that connects the same fields as some other path.
Input

Line 1: Two space-separated integers: F and R 

Lines 2..R+1: Each line contains two space-separated integers which are the fi