|
计算机科学 2012
Improved Dijkstra Shortest Path Algorithm and its Application
|
Abstract:
The problem of "the shortest path" has wide application.There are many algorithms to solve this problem and the best one is "Dijkstra’s label algorithm".But experiment results show that this algorithm needs to be improved:①The algorithm’s exit mechanism is ineffective to non-unicom figure and will fall into an infinite loop;②The algorithm is not concerned in the problem of previous adjacent vertices in shortest path;③The algorithm is not concerned in the problem that more vertices obtain the "p-label" at the same time.This paper improved the "Dijkstra’s label algorithm".Experiment results indicate that the improved algorithm can solve above problems effectively.On the basis of the above work,we developed the "Beijing Road optimal route selection system",which help users to select the shorted route,so that people can avoid the most congested road traffic and save time.