一、　　目的：

对应数据结构课程所学的基本原理和方法，学习图状结构求最短路径的算法，将理论知识运用于实际。

二、　　任务：

请根据附图和附表，设计一个武汉市交通导引系统。用户输入起点站和目标站，系统显示起点站到目标站的最短路径。

三、　　要求：

1.　　提示用户输入起点站和目标站

2.　　系统向用户显示一条最短路径（经过站数最少的路线），如果有两条以上最短路线，则按换乘次数排序显示。

3.　　显示每一条路线时，不仅要显示应搭乘的车次，还要显示应搭乘站的站名。

四、　　提示：

将每一站的权值设定为1，可以使用Dijkstra算法实现。

-one purpose : Corresponding data structure courses are taught the basic principles and methods learning map structure for the shortest path algorithm, the actual application of theoretical knowledge. Two tasks : According to the attached map and schedule, design a Wuhan city traffic guidance system. User input starting point and goal of stations, the system shows starting point to the target point is the shortest path. 3, asked : 1. prompt the user input starting point and goal of Station 2. System users to show a shortest path (at least after a few stops the line ), if there are more than two shortest routes, according to the number of transfer order shows. 3. To show a line, not only to show that the vehicles should take, but also indicate that it should be traveled Station in name. 4, T