Dijkstra algorithm base on directed graph without cycle of minus length
Deng Zhuang · Journal of Chongqing University of Posts and Telecommunications · 2006
In all shortest path algorithms, Dijkstra algorithm is fairly good acceptedly, Single-Source Shortest-Paths Problem is the core one in shortest path problem family. Base on Single-Source Shortest-Paths Problem, about function we improve Dijkstra algorithm work at positive weight direction graph. Then, Dijkstra algorithm can work at direction graph without cycle of minus length.