基于最短路径的校园导航问题

任务：设计你的学校的平面图，至少包括10个以上的场所，每两个场所间可以有不同的路，且路长也可能不同，找出从任意场所到达另一场所的最佳路径（最短路径）。

基本功能：

设计校园平面图，在校园景点选10个左右景点。以图中顶点表示校园内各景点，存放景点名称、代号、简介等信息；以边表示路径，存放路径长度等有关信息。

为来访客人提供图中任意景点相关信息的查询。

为来访客人提供任意景点的问路查询，即查询任意两个景点之间的一条最短路径。

实现提示：一般情况下，校园的道路是双向通行的，可设计校园平面图是一个无向网。顶点和边均含有相关信息。

基本要求：　　

图结构保存在文件中，且允许添加节点与路径。

-Based on the campus of the shortest path navigation

Task: to design the floor plan of your school, including at least more than 10 places, each of the two sites can have different road, and the long road may be different, find out the best path to reach the other places (minimum from any place path).

Basic functions:

Design a campus plan to choose 10 attractions on campus attractions. To vertices in the graph campus attractions, attractions in store name, code, Profile and other information　to the side of the path to store the path length and other relevant information.

Query information of any attractions for the visiting guests.

Any attractions for the visiting guests ask for directions query, that query the shortest path between any two points of interest.

It realize Tip: Under normal circumstances, the campus road is a two-way traffic can design a campus plan to the network. Vertices and edges contain relevant information.

Basic requirements:

Graph structure is stored in a