Improved Matrix Iterative Label Algorithm for the Shortest Path Problem
The shortest path model is a classical problem in graph theory, aiming at the shortage of the traditional Dijkstra algorithm, proposes a ma-trix iterative label algorithm. The Improved algorithm can not only effectively solve the negative weight shortest path problem, and when there are exist multiple shortest paths between two points, the improved algorithm can also get all the shortest paths. Experimental results show that, the improved algorithm has lower time complexity than the traditional Dijkstra algorithm, and the algorithm is simple and easy to implement.
NETL
NSTL
万方数据
维普
