Two Phase Shortest Path Algorithm for Non-Negative Undirected Graphs

• Main Authors: Qureshi, MA., Hassan, M.F., Safdar, S., Akhbar, R.
• Format: Conference or Workshop Item
• Published: 2010
• Subjects: QA75 Electronic computers. Computer science; QA76 Computer software
• Online Access: http://doi.ieeecomputersociety.org/10.1109/ICCSN.2010.97; http://eprints.utp.edu.my/1688/

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...