基于Dijkstra算法的一类最长路问题的一种改进算法  

An Improved Algorithm of Longest Paths Based on Dijkstra Algorithm

作　　者：李宝凤[1] 郝璞玉[1] LI Bao-feng;HAO Pu-yu(Department of Mathematics and Information Science, Tangshan Normal University, Tangshan 063000, China)

机构地区：[1]唐山师范学院数学与信息科学系

出　　处：《唐山师范学院学报》2019年第3期35-36,共2页Journal of Tangshan Normal University

摘　　要：目前认为Dijkstra算法是求解指定两点间或从指定点到其余各点无负权网络最短路问题的最好方法,但不能求解最长路问题。提出一种改进算法,求解最长路问题,并给出一个实例说明该算法的正确性。Now the Dijkstra algorithm is thought as the best way to solve problems of the shortest road without negative network, which are to specify two points or from the specified point to the remaining points. However it can’t be applied to solve problems of the longest road. In this paper An improved adaptive algorithm is proposed and an example is given to illustrate the correctness of the algorithm.

关 键 词：最长路 设备更新 Dijkstra算法改进 

分 类 号：O228[理学—运筹学与控制论]