Affiliation:
1. Hengyang Normal University
2. Guilin University of Technology
Abstract
The existing transportation service system in public travel route can not satisfy the people's actual travel need because of various technologies reasons. In our study, we set the tourist attractions as a vertex, and simplified the traditional algorithm for complex network computing. Aim to use the advantage of Dijkstra algorithm, the Dijkstra algorithm was applied to tourism path search. The experimental results have illustrated that the Dijkstra algorithm can accomplish a good result in search efficiency.
Publisher
Trans Tech Publications, Ltd.
Reference10 articles.
1. E.W. Dijkstra, A note on two problems in connection with graphs, Numerische Mathematik, 1959. 1269-271.
2. A. Aggarwal, B. Schieber, and T. Tokuyama. Finding a minimum weight K-link path in graphs with Monge property and applications. Proc. 9th Symp. Computational Geometry, Assoc. for Computing Machinery, 1993. 189–197.
3. D. Wagner and T. Willhalm. Geometric Speed-Up Techniques for Finding Shortest Paths in Large Sparse Graphs. In European Symposium on Algorithms, (2003).
4. Fang Hui, Hong Weijun, Shortest Path Algorithm within Dynamic Restricted Searching Area in City Emergency Rescue[J], Journal of Chinese People's Public Security University(Science and Technology), 2010. 4(4): 87-91.
5. Fang MeiHong, Liu ShaoHua. The Design and Realization of the shortest path Algorithm Based on VC++. [J] Urban Geotechnical investigation & surveying, 2008. 1: 43-46.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献