Subway Map（图的遍历，麻烦

最新推荐文章于 2022-07-07 19:06:33 发布

CharlieBrownn

最新推荐文章于 2022-07-07 19:06:33 发布

阅读量1.1k

点赞数

分类专栏：帕特

本文链接：https://blog.csdn.net/ZSCharlie/article/details/84791248

版权

该博客介绍了一个关于如何解决复杂城市地铁线路中寻找从起点到终点最短路径的问题。给定地铁线路数据和查询，算法需要找到最少换乘次数的最优路径，并以友好的格式展示结果。

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

用 vector 类型的line[a[i-1]*10000+a[i]] 像这样子存是否换乘
开vector的点来存边

In the big cities, the subway systems always look so complex to the visitors. To give you some sense, the following figure shows the map of Beijing subway. Now you are supposed to help people with your computer skills! Given the starting position of your user, your task is to find the quickest way to his/her destination.
在这里插入图片描述

Input Specification:
Each input file contains one test case. For each case, the first line contains a positive integer N (≤ 100), the number of subway lines. Then N lines follow, with the i-th (i=1,⋯,N) line describes the i-th subway line in the format:

M S[1] S[2] … S[M]

where M (≤ 100) is the number of stops, and S[i]'s (i=1,⋯,M) are the indices of the stations (the indices are 4-digit numbers from 0000 to 9999) along the line. It is gu