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...
保存先:
| 主要な著者: | , , , |
|---|---|
| フォーマット: | 論文 |
| 出版事項: |
2010
|
| 主題: | |
| オンライン･アクセス: | http://eprints.utp.edu.my/2122/1/IJCIS_2009_2.rar http://eprints.utp.edu.my/2122/ |
| タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|