关于最短路径问题的一种有效算法.pdfVIP

22 11 System s Engineering and Electronics Vol22 , No11 2000 : 1001-506X( 2000) 11-0094-04 吴晓红 中山学院计算机系, 528402 经典的关于最短路径算法是基于图的搜索思想的Di kstra 提出的单源点最短路径和所有顶点对 间的最短径算法就是较为成熟的经典算法但人们在长期的使用过程中感到其算法结构过于复杂且效率较低 对Di kstra 最短路径算法进行了改进, 提出了WY- Di kstra 算法改进后的算法不实施Di kstra 算法的重复循环, 而 是作映射或链接处理, 从而提高了效率这 一算法适合于复杂的智能系统的应用 路径 算法 系统效率 :TP3016 On an Effective Algorithm of the Shortest Path Problem Wu Xiaohong Department of Comp uter of Zhongshan College, 528402 Abstract 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 Di kstra, is maturer classical algorithm. But its complex algo- rithm structure and its lower efficiency is known by us for a long time. In this paper, the Di kstras algorithm of shortest path problem is improved and the WY- Di kstra algorithm is given . The new algorithm does not carry out a recycle of the Di kstras algorithm . The WY- Di stra algorithm only carry out mapping or linked list and so has raised efficiency. This algorithm can be applied to artificial intelligence system. Keywords Path Algorithm System efficiency V V i 1 Di kstra , , ( 1) cost , cost [ i,j ] V, V ( i j , cost[ i,j] , , i j