A New Solution to the Shortest Path Problem of Weighted Graph

Zhang Jian-ye · Journal of Hebei Engineering and Technical College · 2004

In this paper,a new algorithm to solve the shortest path problem of weighted graph is advanced.It remedies the defect of Dijkstra's algorithm, which can not be used to solve the shortest path problem with some negative weights.

Read the paper · More papers on PaperTik