文件名称:Campus-tour-guide-system
介绍说明－－下载内容均来自于网络，请自行研究使用
[实验目的]
1. 熟悉图的存储结构
2. 掌握图的最短路径算法
[实验内容]
用无向网表示学校的校园景点平面图，图中顶点表示主要景点，存放景点的编号、名称、简介等信息，图中的边表示景点间的道路，存放路径长度等信息。要求能够回答有关景点介绍、游览路径等问题。
[实验要求]
1 查询各景点的相关信息；
2 查询图中任意两个景点间的最短路径。
3 查询图中任意两个景点间的所有路径。
-[Experimental purposes] 1. Familiar with the storage structure of Figure 2. To master plan the shortest path algorithm [experimental content] free to the net means that schools Attractions plan, map, said the main attractions vertex, store the number of spots, names, profile, etc. information, the figure that the attraction between the edges of roads, storage of information such as path length. Asked to answer questions about attractions, the tour path and so on. [Experiment] 1 query the various scenic spots in the relevant information 2 query graph between any two spots of the shortest path. 3 query graph between any two spots of all the paths.
1. 熟悉图的存储结构
2. 掌握图的最短路径算法
[实验内容]
用无向网表示学校的校园景点平面图，图中顶点表示主要景点，存放景点的编号、名称、简介等信息，图中的边表示景点间的道路，存放路径长度等信息。要求能够回答有关景点介绍、游览路径等问题。
[实验要求]
1 查询各景点的相关信息；
2 查询图中任意两个景点间的最短路径。
3 查询图中任意两个景点间的所有路径。
-[Experimental purposes] 1. Familiar with the storage structure of Figure 2. To master plan the shortest path algorithm [experimental content] free to the net means that schools Attractions plan, map, said the main attractions vertex, store the number of spots, names, profile, etc. information, the figure that the attraction between the edges of roads, storage of information such as path length. Asked to answer questions about attractions, the tour path and so on. [Experiment] 1 query the various scenic spots in the relevant information 2 query graph between any two spots of the shortest path. 3 query graph between any two spots of all the paths.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
校园导游系统.cpp