Java实现One-way traffic（单向交通）

最新推荐文章于 2023-03-23 17:46:43 发布

南墙

最新推荐文章于 2023-03-23 17:46:43 发布

阅读量1.2w

点赞数 18

CC 4.0 BY-SA版权

分类专栏：算法练习题文章标签： Java One-way traffic 图论之桥

本文链接：https://blog.youkuaiyun.com/a1439775520/article/details/97401150

该程序旨在设计一个城镇的交通系统，使尽可能多的双向街道变为单向，同时保持任意两个交叉口之间的双向通行。输入包含交叉口数量和街道信息，程序需确定每个双向街道的新方向或维持其双向状态。输出是重新定向的街道列表，以最大化单向街道数量。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

One-way traffic

In a certain town there are n intersections connected by two- and one-way streets. The town is very
modern so a lot of streets run through tunnels or viaducts. Of course it is possible to travel between
any two intersections in both ways, i.e. it is possible to travel from an intersection a to an intersection
b as well as from b to a without violating traffic rules. Because one-way streets are safer, it has been
decided to create as much one-way traffic as possible. In order not to make too much confusion it has
also been decided that the direction of traffic in already existing one-way streets should not be changed.
Your job is to create a new traffic system in the town. You have to determine the direction of
traffic for as many two-way streets as possible and make sure that it is still possible to travel both ways
between any two intersections.
Write a program that:
• reads a description of the street system in the town from the standard input,
• for each two-way street determines one direction of traffic or decides that the street must remain
two-way,
• writes the answer to the standard output.

Input
The first line of the input contains two integers n and m, where 2 ≤ n ≤ 2000 and n−1 ≤ m ≤ n(n−1)/2.
Integer n is the number of intersections in the t