摘要
最短路权矩阵法是通过权矩阵计算来实现Dijkstra算法的一种方法。针对权矩阵法在大型网络应用中的不足,从提高算法效率和增强寻路直观性两个方面对其进行了改进,并给出了新的算法。新算法既能快速计算最短路权又能更直观地找出网络中的最短路,是一种计算最短路的简捷方法。仿真结果和算例表明了新算法的有效性。
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 algorithm.
出处
《计算机工程与设计》
CSCD
北大核心
2008年第5期1157-1159,共3页
Computer Engineering and Design
基金
陕西省自然科学基础研究计划基金项目(2006A12)
