An improvement of the shortest path algorithm based on Dijkstra algorithm
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.