An improvement of the shortest path algorithm based on Dijkstra algorithm

Autor:	Fang-Ling Lu, Ji-Xian Xiao
Rok vydání:	2010
Předmět:	Euclidean shortest path Mathematical optimization Shortest Path Faster Algorithm Shortest path problem Suurballe's algorithm K shortest path routing Pathfinding Yen's algorithm Constrained Shortest Path First MathematicsofComputing_DISCRETEMATHEMATICS Mathematics
Zdroj:	2010 The 2nd International Conference on Computer and Automation Engineering (ICCAE).
DOI:	10.1109/iccae.2010.5451564
Popis:	In this paper, based on the Dijkstra algorithm and its past improvements, a new improvement is proposed by considering the case of the nodes, reforming the feature matrix of precursor node, and adding a shortest path tree. The algorithm has its adantages on both reducing the number of repeated operations and reading the shortest path and the path length from the startpoint to all the other nodes by the shortest path tree or by the feature matrix.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::9ef17d7e3ef5c6b477114179b1dfec43 https://doi.org/10.1109/iccae.2010.5451564 Zobrazit plný text záznamu