摘要
经典的关于最短路径算法是基于图的搜索思想的。Dijkstra提出的单源点最短路径和所有顶点对之间的最短径算法就是较为成熟的经典算法。但人们在长期的使用过程中感到其算法结构过于复杂且效率较低。对Dijkstra最短路径算法进行了改进 ,提出了WY -Dijkstra算法。改进后的算法不实施Dijkstra算法的重复循环 ,而是作映射或链接处理 ,从而提高了效率。
The clssical algorithm about the shortest path is based on searching method of graph. The algorithm of the shortest path of single source and among all vertex pairs, which is suggested by Dijkstra, is maturer classical algorithm. But its complex algorithm structure and its lower efficiency is known by us for a long time. In this paper, the Dijkstra′s algorithm of shortest path problem is improved and the WY-Dijkstra algorithm is given. The new algorithm does not carry out a recycle of the Dijkstra′s algorithm. The WY-Dijstra algorithm only carry out mapping or linked list and so has raised efficiency. This algorithm can be applied to artificial intelligence system.
出处
《系统工程与电子技术》
EI
CSCD
2000年第11期94-96,f003,共4页
Systems Engineering and Electronics
