An Edge-Wise Linear Shortest Path Algorithm for Non-Negative Weighted Undirected Graphs
In most of the shortest path problems like vehicle routing problems and network routing problems, we only need an efficient path between two points—source and destination, and it is not necessary to calculate the shortest path from source to all other nodes. This paper concentrates on this very...
| Main Authors: | , , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
2010
|
| Subjects: | |
| Online Access: | http://scholars.utp.edu.my/id/eprint/2134/ http://scholars.utp.edu.my/id/eprint/2134/1/An_Edge-wise_Linear_Shortest_Path_Algorithm_for_Non_Negative_Weighted_Undirected_Graphs.rar |