基于Dijkstra算法的优化研究

Optimization Research Based on Dijkstra Algorithm

最短路径算法的研究及其应用在各个领域都起着重要作用,例如交通领域的最优路线,军事领域的行军路线,网络通信领域的路由选择等。该文将对最短路径问题中最经典的Dijkstra(迪杰斯特拉)算法进行介绍和优化改进。笔者将这种优化改进后的算法称之为:DJ_ray算法,意思是对Dijkstra算法进行发散性思想优化。该文将会对传统的Dijkstra算法与优化后的DJ_ray算法,在思想、原理、实现方法、数据结构上进行说明比较,并从时间及其空间复杂度上进行分析对比。同时,为了更好地展示DJ_ray算法在实际应用中的优点,文本将以DJ_ray算法优化火车交通网络路线为案例来进行阐述。

Research and application of the shortest path algorithm plays an important role in every field, such as the optimal route in the field of transportation, travel route in the field of military, routing in the field of network communication, etc.As a result,the efficiency of the shortest path algorithm in practical application of product development still need to continuously improve.This article will be to the shortest path problem is one of the most classical Dijkstra(Dijkstra) algorithm is introduced and the optimization improvement.I will improve after this optimization algorithm called: DJ_ray algorithm,meaning: the Dijkstra algorithm to optimize divergent thinking.This article will be to the traditional Dijkstra algorithm and the optimization of the improved DJ_ray algorithm, in the thought, principle, method, data structure are compared, and explain and analysis comparison from time and space complexity.At the same time, in order to better display DJ_ray algorithm advantages in practical application, the text will be DJ_ray algorithm in GIS, the train traffic network route as a case, through a combination of theory and practice for everyone.