Analysis and Improvement of Dijkstra Algorithm
Yao Yao · Journal of Hubei University of Education · 2008
The algorithm of Dijkstra is academic foundation that many engineerings were solved in the shortest path issue,applied widely.There are some malpractices when a shortest path between nodes is searched with traditional Dijkstra algorithm,so that the efficiency of Dijkstra algorithm is low.By improving memory space and increasing operation speed,this paper raises a new Dijkstra algorithm.After comparison and analysis,the improved algorithm is better than the traditional Dijkstra algorithm and is especially adaptable to large-scale networks.