Two Phase Shortest Path Algorithm for Non-Negative Undirected Graphs
Breadth First Search (BFS) can calculate the shortest path for un-weighted graphs very efficiently but when it comes to non-negative weighted graphs it fails at a point when a successor updates a predecessor. Such nodes are being referred as Culprit nodes in this research. These Culprit nodes are th...
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2010
|
| Subjects: | |
| Online Access: | http://scholars.utp.edu.my/id/eprint/1688/ |