Optimized Strategy Research over Algorithm of Dijkstra
Ding Hao-jie · Computer Technology and Development · 2006
The algorithm of Dijkstra is academic foundation that many engineerings were solved in the shortest path issue,but people must improve and optimize to this algorithm what involves many limitative condition in the real engineering.So makes a summary on the foundation analysed to the algorithm of Dijkstra thought of classics,and discussed one kind of algorithm improving the algorithm of Dijkstra called A* Algorithm,to dissect the contact between them.On sum up the foundation of a real project,put forward based on being directed against railway two stations the shortest path algorithm on the algorithm of Dijkstra.The algorithm that was made in this article is put forward a new figure by way drawing out the hinge station in the railway.Afterwards,inserting starting station and terminal station to the new figure,you can select out the shortest path of railway after the combination of unexcelled four times the range.The optimized method can fall n value with the algorithm of Dijkstra of the time complexity o(n~2) to a very small value.The practice proves this method is feasible completely in the real engineering and has taken satisfied effect.