文件名称:NIT_daohang
介绍说明－－下载内容均来自于网络，请自行研究使用
校园导航问题
设计目标：
设计学校的平面图，至少包括10个以上的场所，每两个场所间可以有不同的路，且路长也可能不同，找出从任意场所到达另一场所的最佳路径（最短路径）。
基本要求一般情况下，校园的道路是双向通行的，可设计校园平面图是一个无向网。顶点和边均含有相关信息。
（1）定义数据结构：设计校园平面图，在校园景点选10个左右景点。以图中顶点表示校园内各景点，存放景点名称、代号、简介等信息；以边表示路径，存放路径长度等有关信息。
（2）为来访客人提供图中任意景点相关信息的查询。
（3）为来访客人提供任意景点的问路查询，即查询任意两个景点之间的一条最短路径。-Campus navigation design objectives: a plan view of the design schools, including at least more than 10 places, between each two sites may have a different way, and the path length may also be different to identify the best path to reach another place from any place (shortest path). The basic requirements under normal circumstances, the campus road is two-way traffic, design campus plan is an undirected network. Vertices and edges contain relevant information. (1) the definition of data structures: design campus plan attractions on campus at about 10 attractions. Campus attractions, attractions store name, Code brief side of said path, storage path length and other information about the vertices in the graph. (2) information query any attractions for visiting guests. (3) any attractions for visiting guests ask for directions query, that query a shortest path between any two attractions.
设计目标：
设计学校的平面图，至少包括10个以上的场所，每两个场所间可以有不同的路，且路长也可能不同，找出从任意场所到达另一场所的最佳路径（最短路径）。
基本要求一般情况下，校园的道路是双向通行的，可设计校园平面图是一个无向网。顶点和边均含有相关信息。
（1）定义数据结构：设计校园平面图，在校园景点选10个左右景点。以图中顶点表示校园内各景点，存放景点名称、代号、简介等信息；以边表示路径，存放路径长度等有关信息。
（2）为来访客人提供图中任意景点相关信息的查询。
（3）为来访客人提供任意景点的问路查询，即查询任意两个景点之间的一条最短路径。-Campus navigation design objectives: a plan view of the design schools, including at least more than 10 places, between each two sites may have a different way, and the path length may also be different to identify the best path to reach another place from any place (shortest path). The basic requirements under normal circumstances, the campus road is two-way traffic, design campus plan is an undirected network. Vertices and edges contain relevant information. (1) the definition of data structures: design campus plan attractions on campus at about 10 attractions. Campus attractions, attractions store name, Code brief side of said path, storage path length and other information about the vertices in the graph. (2) information query any attractions for visiting guests. (3) any attractions for visiting guests ask for directions query, that query a shortest path between any two attractions.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
NIT_daohang.cpp