A O(|E|) Time 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...
Saved in:
| Main Authors: | , , , |
|---|---|
| 格式: | Article |
| 出版: |
2010
|
| 主题: | |
| 在线阅读: | http://eprints.utp.edu.my/2122/1/IJCIS_2009_2.rar http://eprints.utp.edu.my/2122/ |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|