Improvement on weight matrix method for shortest-paths problem
Jiao Jian-min · Jisuanji gongcheng yu sheji · 2008
The weight matrix method for the shortest-paths problem is one of the methods of carrying out the Dijkstra algorithm though weight matrix calculating.To correct the shortcomings of weight matrix method for the shortest-paths problem,a new algorithm is pre-sented,which is obtained by improving the efficiency of weight matrix method and enhancing observation for finding shortest-paths.Since it can both calculate shortest-path weights more quickly and find shortest paths more directly,the new algorithm is a simple and direct method for calculating shortest paths from the source vertex.Simulation results and example show the effectiveness of the new al-gorithm.