最短路问题优化算法的分析与研究
首发时间:2009-12-15
摘要:本文研究了Dijksta算法的几种优化方法。在大量的最短路算法中,Dijksta算法是一种最经典的方法,很多算法都是在该算法的基础上经过改进发展而来的,在实际工程中涉及到的许多限制条件要求人们必须对该算法进行改进和优化。本文中在对经典的Dijkstra算法思想进行分析的基础上,对A*算法、邻接结点算法等几种优化算法进行了分析。
关键词: Dijkstra算法 A*算法 邻接结点算法
For information in English, please click here
Study on Optimized short-circuit Algorithm
Abstract:In this paper, several Optimized short-circuit Algorithm is studied. In most significant short-circuit algorithm, Dijkstra algorithm is one of the most classic one, many algorithms are on the basis of it or improved from it. And it is related to the many restrictions on the terms and conditions. The algorithm must be improved. In this paper, the thinking on classic Dijkstra algorithm discusses, Dijkstra algorithm for an improved algorithm - A * algorithm, and the linkages between them for the analysis. Large volume of data processing for the shortest path problem, introduced a Dijkstra algorithm optimization algorithm - the adjacent nodes algorithm. And the use of storage based on the linked list structure for the further optimization algorithm, can further improve the efficiency of the search algorithm.
Keywords: Dijkstra algorithm A* algorithm Adjacent node algorithm
基金:
论文图表:
引用
No.3756550578012608****
同行评议
共计0人参与
勘误表
最短路问题优化算法的分析与研究
评论
全部评论0/1000