文件名称:HUST
-
所属分类：
- 标签属性：
- 上传时间：2012-09-04
-
文件大小：5.66mb
-
已下载：0次
-
提 供 者：
-
相关连接：无下载说明：别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容来自于网络，使用问题请自行百度
校园导游与导航，能够实现起点到终点的最短路径，即导航功能；也能找出从任意一点出发遍历所有景点而不重复，最后回到起点的最短路径。
校园导游与导航问题
某大学的平面图包括大学的m个人文景点，n个教室和宿舍，根据该大学的平面图，设计一个查询系统。
问题1：假设游客可以从任意一个地点出发，规划一条最短路线，使游客可以不重复地游览各人文景点，最后回到出发地。
问题2：假设访客可以从任意一个地点出发，规划一条最短路线，使访客至少经过一个人文景点而到达目的地。
要求：
1）校园拓扑图由一个文件来加载，通过修改文件可加入或减少校园的场所；
2）设计并实现一个能表达校园拓扑的方案，此方案可以存储在文件中，并能方便地编辑；
3）界面友好；
4）必须按软件工程规范来完成本设计任务。-Campus tour guide and navigation, to achieve the shortest path to the end point, namely navigation can find from any one
Point of departure through all the sights without duplication, and finally back to the starting point of the shortest path.
Campus tour guide and navigation problems
The plan includes a university college text of the m individual spots, n classrooms and dormitories, according to the University s plan, set
Design a query system.
Question 1: Suppose visitors can start from any location, plan a shortest route, so that visitors can not repeat
Way to explore the cultural attractions, and finally back to the point of departure.
Question 2: Suppose that visitors can start from any location, plan a shortest route, so that visitors at least through a
Personal and cultural attractions the destination.
Requirements:
1) Campus topology consists of a file to load, or by modifying the file can be added to reduce the campus sites
2) design and implemen
校园导游与导航问题
某大学的平面图包括大学的m个人文景点，n个教室和宿舍，根据该大学的平面图，设计一个查询系统。
问题1：假设游客可以从任意一个地点出发，规划一条最短路线，使游客可以不重复地游览各人文景点，最后回到出发地。
问题2：假设访客可以从任意一个地点出发，规划一条最短路线，使访客至少经过一个人文景点而到达目的地。
要求：
1）校园拓扑图由一个文件来加载，通过修改文件可加入或减少校园的场所；
2）设计并实现一个能表达校园拓扑的方案，此方案可以存储在文件中，并能方便地编辑；
3）界面友好；
4）必须按软件工程规范来完成本设计任务。-Campus tour guide and navigation, to achieve the shortest path to the end point, namely navigation can find from any one
Point of departure through all the sights without duplication, and finally back to the starting point of the shortest path.
Campus tour guide and navigation problems
The plan includes a university college text of the m individual spots, n classrooms and dormitories, according to the University s plan, set
Design a query system.
Question 1: Suppose visitors can start from any location, plan a shortest route, so that visitors can not repeat
Way to explore the cultural attractions, and finally back to the point of departure.
Question 2: Suppose that visitors can start from any location, plan a shortest route, so that visitors at least through a
Personal and cultural attractions the destination.
Requirements:
1) Campus topology consists of a file to load, or by modifying the file can be added to reduce the campus sites
2) design and implemen
(系统自动生成,下载前可以参看下载内容)
下载文件列表
HUST/
HUST/11.h
HUST/BianHaoJieShaoDlg.cpp
HUST/BianHaoJieShaoDlg.h
HUST/BianHaoSousuoDlg.cpp
HUST/BianHaoSousuoDlg.h
HUST/Debug/
HUST/Debug/BianHaoJieShaoDlg.obj
HUST/Debug/BianHaoJieShaoDlg.sbr
HUST/Debug/BianHaoSousuoDlg.obj
HUST/Debug/BianHaoSousuoDlg.sbr
HUST/Debug/MainFrm.obj
HUST/Debug/MainFrm.sbr
HUST/Debug/StdAfx.obj
HUST/Debug/StdAfx.sbr
HUST/Debug/Swust.bsc
HUST/Debug/Swust.exe
HUST/Debug/Swust.ilk
HUST/Debug/Swust.obj
HUST/Debug/Swust.pch
HUST/Debug/Swust.pdb
HUST/Debug/Swust.res
HUST/Debug/Swust.sbr
HUST/Debug/Swust1.obj
HUST/Debug/Swust1.sbr
HUST/Debug/SwustDoc.obj
HUST/Debug/SwustDoc.sbr
HUST/Debug/SwustView.obj
HUST/Debug/SwustView.sbr
HUST/Debug/TspDlg.obj
HUST/Debug/TspDlg.sbr
HUST/Debug/vc60.idb
HUST/Debug/vc60.pdb
HUST/MainFrm.cpp
HUST/MainFrm.h
HUST/ReadMe.txt
HUST/StdAfx.cpp
HUST/StdAfx.h
HUST/Swust.aps
HUST/Swust.clw
HUST/Swust.cpp
HUST/Swust.dsp
HUST/Swust.dsw
HUST/Swust.h
HUST/Swust.ncb
HUST/Swust.opt
HUST/Swust.plg
HUST/Swust.rc
HUST/Swust.sln
HUST/Swust.suo
HUST/Swust.vcxproj
HUST/Swust.vcxproj.filters
HUST/Swust.vcxproj.user
HUST/Swust1.cpp
HUST/Swust1.h
HUST/SwustDoc.cpp
HUST/SwustDoc.h
HUST/SwustView.cpp
HUST/SwustView.h
HUST/TspDlg.cpp
HUST/TspDlg.h
HUST/res/
HUST/res/HUST.bmp
HUST/res/Swust.ico
HUST/res/Swust.rc2
HUST/res/SwustDoc.ico
HUST/res/Thumbs.db
HUST/res/Toolbar.bmp
HUST/resource.h
HUST/tuxingxi.txt
HUST/保留/
HUST/保留/tuxingxi.txt
HUST/11.h
HUST/BianHaoJieShaoDlg.cpp
HUST/BianHaoJieShaoDlg.h
HUST/BianHaoSousuoDlg.cpp
HUST/BianHaoSousuoDlg.h
HUST/Debug/
HUST/Debug/BianHaoJieShaoDlg.obj
HUST/Debug/BianHaoJieShaoDlg.sbr
HUST/Debug/BianHaoSousuoDlg.obj
HUST/Debug/BianHaoSousuoDlg.sbr
HUST/Debug/MainFrm.obj
HUST/Debug/MainFrm.sbr
HUST/Debug/StdAfx.obj
HUST/Debug/StdAfx.sbr
HUST/Debug/Swust.bsc
HUST/Debug/Swust.exe
HUST/Debug/Swust.ilk
HUST/Debug/Swust.obj
HUST/Debug/Swust.pch
HUST/Debug/Swust.pdb
HUST/Debug/Swust.res
HUST/Debug/Swust.sbr
HUST/Debug/Swust1.obj
HUST/Debug/Swust1.sbr
HUST/Debug/SwustDoc.obj
HUST/Debug/SwustDoc.sbr
HUST/Debug/SwustView.obj
HUST/Debug/SwustView.sbr
HUST/Debug/TspDlg.obj
HUST/Debug/TspDlg.sbr
HUST/Debug/vc60.idb
HUST/Debug/vc60.pdb
HUST/MainFrm.cpp
HUST/MainFrm.h
HUST/ReadMe.txt
HUST/StdAfx.cpp
HUST/StdAfx.h
HUST/Swust.aps
HUST/Swust.clw
HUST/Swust.cpp
HUST/Swust.dsp
HUST/Swust.dsw
HUST/Swust.h
HUST/Swust.ncb
HUST/Swust.opt
HUST/Swust.plg
HUST/Swust.rc
HUST/Swust.sln
HUST/Swust.suo
HUST/Swust.vcxproj
HUST/Swust.vcxproj.filters
HUST/Swust.vcxproj.user
HUST/Swust1.cpp
HUST/Swust1.h
HUST/SwustDoc.cpp
HUST/SwustDoc.h
HUST/SwustView.cpp
HUST/SwustView.h
HUST/TspDlg.cpp
HUST/TspDlg.h
HUST/res/
HUST/res/HUST.bmp
HUST/res/Swust.ico
HUST/res/Swust.rc2
HUST/res/SwustDoc.ico
HUST/res/Thumbs.db
HUST/res/Toolbar.bmp
HUST/resource.h
HUST/tuxingxi.txt
HUST/保留/
HUST/保留/tuxingxi.txt
本网站为编程资源及源代码搜集、介绍的搜索网站，版权归原作者所有！ 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.