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...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2010
|
| Subjects: | |
| Online Access: | http://doi.ieeecomputersociety.org/10.1109/ICCSN.2010.97 http://eprints.utp.edu.my/1688/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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 the ones that cause error in shortest path in an algorithm that traverses like BFS. This research targets on recognizing and marking Culprit nodes to disengage them until they are properly and completely updated. Processing through such nodes is postponed until all possible updates are made on these nodes nullifying all possible chances of errors. As nodes are being traversed in BFS fashion with few violations and additions promising a O(k(|V| + |E|)) time algorithm where 0<k<log n. More over this algorithm does not need any complex data structure. |
|---|