文件名称:Cpp1
介绍说明－－下载内容均来自于网络，请自行研究使用
/*【4.5】全国著名景点导游咨询
[ 问题描述 ]
用无向网表示全国著名旅游景点平面图，图中顶点表示主要景点，存放景点编号、名称、简介、门票价格等信息，图中边表示景点间的道路，存放路程长度和行程费用信息。
[ 基本要求 ]
（1）查询各景点的相关信息；
（2）查询图中任意两个景点间的最短路径
（3）查询图中任意两个景点间的最经济路径
（4）根据游客计划的旅游费，为游客推荐最节省的旅游线路与景点*/-/* [4.5] famous attractions guide consultation [Problem Descr iption] with undirected network plan, said the country' s leading tourist attractions, drawing the vertices represent the main attractions, attractions store information number, name, profile, ticket prices, graph edges represent Attractions between road, path length and travel costs to store information. [Basic requirements] (1) check the attractions of relevant information (2) any query graph shortest path between two points of interest (3) any query graph the most economical path between two sites (4) According to the tourists plan Tourism fee for visitors to recommend the most economical travel routes and attractions* /
[ 问题描述 ]
用无向网表示全国著名旅游景点平面图，图中顶点表示主要景点，存放景点编号、名称、简介、门票价格等信息，图中边表示景点间的道路，存放路程长度和行程费用信息。
[ 基本要求 ]
（1）查询各景点的相关信息；
（2）查询图中任意两个景点间的最短路径
（3）查询图中任意两个景点间的最经济路径
（4）根据游客计划的旅游费，为游客推荐最节省的旅游线路与景点*/-/* [4.5] famous attractions guide consultation [Problem Descr iption] with undirected network plan, said the country' s leading tourist attractions, drawing the vertices represent the main attractions, attractions store information number, name, profile, ticket prices, graph edges represent Attractions between road, path length and travel costs to store information. [Basic requirements] (1) check the attractions of relevant information (2) any query graph shortest path between two points of interest (3) any query graph the most economical path between two sites (4) According to the tourists plan Tourism fee for visitors to recommend the most economical travel routes and attractions* /
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Cpp1.cpp