A New Algorithm Solution to the Shortest Path Problem of Weighting Directed Graph-Method of Forward Graph
An Kai · 2000
Dijkstra's algorithm of solving the shortest path problem of weighted directed graph is still regarded as the best one.However its weakness is that it can not be used to solve the shortest path problem with some negative weights.A new algorithm,called method of forward graph,can take as a saving method.