An improved algorithm for vertex sequence of shortest path

摘要

It's important to evaluate the shortest paths in many fields. Based on one-dimension arrays an improved algorithm for vertex sequence of shortest path in undirected networks is given. An illumination rule is presented for improving the algorithm efficiency. Both of time and space efficiency can be improved on the rule. Analysis about the algorithm is presented. Experiments have been done for showing the efficiency of the algorithm.