Title: Shortest path problem with multiple shortest paths
Abstract: Though Dijkstra algorithm is the best known algorithm to solve the shortest path problem with nonnegative weight,it can only get one path from the source vertex to a designated vertex.In order to present all shortest paths from the source vertex to a designated vertex,the revised Dijkstra algorithm is obtained by improving the temporary label updating process.As a result,the revised algorithm gives the shortest path graph other than the shortest path tree.Compared with Dijkstra algorithm,the revised algorithm is simple,and all shortest paths can be given according to the number of edge by applying Yen algorithm.
Publication Year: 2010
Publication Date: 2010-01-01
Language: en
Type: article
Access and Citation
Cited By Count: 3
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot