文件名称:xiaoyuandaohangzixun
- 所属分类：
- 数据结构常用算法
- 资源属性：
- [WORD]
- 上传时间：
- 2012-11-26
- 文件大小：
- 102kb
- 下载次数：
- 0次
- 提 供 者：
- guangz******
- 相关连接：
- 无
- 下载说明：
- 别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容均来自于网络，请自行研究使用
校园导游咨询
1．需求分析
1.1从武汉理工大学的平面图上选取10个有代表性的景点，抽象成一个带权无向图。以中顶点表示景点，边上的权值表示图两地之间的距离。
1.2本程序的目的是为用户提供景点信息及路径咨询服务。根据用户指定的景点输出景点信息，或根据用户指定的始点和终点输出相应最短路径。
1.3程序采用对话方式，先显示服务项目，由用户自己选择查询内容。-Campus tour guides Advisory 1. Demand Analysis 1.1 from Wuhan University of Technology on the plan selected 10 representative spots, abstract as a weighted undirected graph. Vertex said in spots, the edge of the weights that map the distance between the two places. 1.2 The procedures are designed to provide users with information and path attractions consulting services. According to user-specified output Attractions Attractions information, or according to user-specified starting point and the end of the output the corresponding shortest path. 1.3 procedures for the use of dialogue, to show services of their choice by the user query.
1．需求分析
1.1从武汉理工大学的平面图上选取10个有代表性的景点，抽象成一个带权无向图。以中顶点表示景点，边上的权值表示图两地之间的距离。
1.2本程序的目的是为用户提供景点信息及路径咨询服务。根据用户指定的景点输出景点信息，或根据用户指定的始点和终点输出相应最短路径。
1.3程序采用对话方式，先显示服务项目，由用户自己选择查询内容。-Campus tour guides Advisory 1. Demand Analysis 1.1 from Wuhan University of Technology on the plan selected 10 representative spots, abstract as a weighted undirected graph. Vertex said in spots, the edge of the weights that map the distance between the two places. 1.2 The procedures are designed to provide users with information and path attractions consulting services. According to user-specified output Attractions Attractions information, or according to user-specified starting point and the end of the output the corresponding shortest path. 1.3 procedures for the use of dialogue, to show services of their choice by the user query.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
xiaoyuandaohangzixun.doc