Design and implementation of shortest travel path searching based on improved Dijkstra algorithm

摘要

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 improve the disadvantage of tradition Dijkstra algorithm, an improve algorithm was proposed to improve the path search efficiency. Then the improved Dijkstra algorithm was applied to tourism path search. The experimental results have illustrated that the improved Dijkstra algorithm can accomplish a better result and improve path search efficiency.