Title :
An improvement of the shortest path algorithm based on Dijkstra algorithm
Author :
Xiao, Ji-Xian ; Lu, Fang-Ling
Author_Institution :
Coll. of Sci., Hebei Polytech. Univ., Tangshan, China
Abstract :
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 advantages 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.
Keywords :
matrix algebra; trees (mathematics); Dijkstra algorithm; feature matrix; graph theory; shortest path algorithm; shortest path tree; Algorithm design and analysis; Decision making; Educational institutions; Graph theory; Transportation; Tree graphs; Dijkstra Algorithm; feature matrix; shortest path; shortest path tree;
Conference_Titel :
Computer and Automation Engineering (ICCAE), 2010 The 2nd International Conference on
Conference_Location :
Singapore
Print_ISBN :
978-1-4244-5585-0
Electronic_ISBN :
978-1-4244-5586-7
DOI :
10.1109/ICCAE.2010.5451564
