题解：John's trip（欧拉回路+dfs)

最新推荐文章于 2021-08-05 14:45:52 发布

嘘......

最新推荐文章于 2021-08-05 14:45:52 发布

阅读量248

点赞数

分类专栏：杂七杂八

本文链接：https://blog.csdn.net/weixin_43540515/article/details/98864995

版权

这篇博客讲述了小Johnny如何试图规划一条通过小镇每个街道仅一次的最短环形路线，从1号路口返回1号路口。题目描述了一个包含多个节点和街道的网络，要求找到字典序最小的欧拉回路。如果不存在这样的路线，程序应给出相应提示。输入文件包含多个街区的数据，每个街区列出连接节点的街道编号。输出是符合要求的路线序列，若无法找到则显示'Round trip does not exist.'。

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

Little Johnny has got a new car. He decided to drive around the town to visit his friends. Johnny wanted to visit all his friends, but there was many of them. In each street he had one friend. He started thinking how to make his trip as short as possible. Very soon he realized that the best way to do it was to travel through each street of town only once. Naturally, he wanted to finish his trip at the same place he started, at his parents’ house.
The streets in Johnny’s town were named by integer numbers from 1 to n, n < 1995. The junctions were independently named by integer numbers from 1 to m, m <= 44. No junction connects more than 44 streets. All junctions in the town had different numbers. Each street was connecting exactly two junctions. No two streets in the town had the same number. He immediately started to plan his round trip. If there was more than one such round trip, he would have chosen the one which, when written down as a sequence of street numbers i