| 最短路径算法在校园导游系统中的应用 |
| |
| 引用本文： | 杨丽萍.最短路径算法在校园导游系统中的应用[J].计算机时代,2014(2):31-32,35. |
| |
| 作者姓名： | 杨丽萍 |
| |
| 作者单位： | 包头师范学院信息科学与技术学院,内蒙古包头014030 |
| |
| 基金项目： | 包头师范学院教改课题（BSJG11024） |
| |
| 摘 要： | 用无向网表示学校的平面图,设计了该平面图的存储结构,并应用最短路径算法实现了查询图中各景点的相关信息,以及查询图中任意两个景点间的最短路径的功能;应用克鲁斯卡尔算法构造该平面图的最小生成树,求出可以连通所有景点的最短路径。该系统为新生熟悉校园环境提供了方便。
|
| 关 键 词： | 无向网 存储结构 最短路径 最小生成树 邻接矩阵 |
Application of shortest path algorithm in the campus guide system |
| |
| Yang Liping.Application of shortest path algorithm in the campus guide system[J].Computer Era,2014(2):31-32,35. |
| |
| Authors: | Yang Liping |
| |
| Affiliation: | Yang Liping (Information Science and Technology Department, Baotou Normal Institute, Baotou, Neimenggu 014030, China) |
| |
| Abstract: | In this paper, the map of campus is drawn by undirected graph, the storage structure of the map is designed. The shortest path algorithm is used to achieve querying relevant information of various view spots in campus and the shortest path between any two spots. Kruskal algorithm is applied to obtain the minimum spanning tree of the planar graph, and find the shortest path connecting all view-spots. These functions will provide convenience for new students to get familiar the campus environment. |
| |
| Keywords: | undirected graph storage structure shortest path minimum spanning tree adjacency matrix |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
