| 校园导航系统最短路径的实现 |
| |
| 引用本文： | 杨伟龙,李步德,谢俊鹏. 校园导航系统最短路径的实现[J]. 韶关学院学报, 2014, 0(4): 20-23 |
| |
| 作者姓名： | 杨伟龙 李步德 谢俊鹏 |
| |
| 作者单位： | 韶关学院档案馆,广东韶关512005 |
| |
| 摘 要： | 随着高校的发展，校园面积不断扩大，为适应数字化校园建设的要求，各高校开发设计了校园导航系统．查询最短路径的实现是校园导航系统主要功能之一，阐述了基于Flash技术开发平台，运用迪杰斯特拉（Dijkstra）算法实现校园导航系统最短路径的功能．
|
| 关 键 词： | 高校 导航系统 最短路径 迪杰斯特拉算法 |
On how to achieve the shortest path campus navigation system |
| |
| YANG Wei-long,LI Bu-de,XIE Jun-peng. On how to achieve the shortest path campus navigation system[J]. Journal of Shaoguan University(Social Science Edition), 2014, 0(4): 20-23 |
| |
| Authors: | YANG Wei-long LI Bu-de XIE Jun-peng |
| |
| Affiliation: | (Archives, Shaoguan University, Shaoguan 512005, Guangdong, China) |
| |
| Abstract: | With the development of colleges and universities, campus area is expanding. To meet the requirements of digital campus construction, it is necessary to develop and design the university campus navigation system. Query shortest path to achieve campus navigation system is one of the main functions, and this paper describes the development platform based on Flash technology, and makes the use of Dijkstra algorithm to achieve the shortest path campus navigation system functions. |
| |
| Keywords: | university navigation system shortest path Dijkstra algorithm |
| 本文献已被 维普 等数据库收录！ |
|
