%R 10.1109/ICCSN.2010.97 %D 2010 %L scholars1257 %J 2nd International Conference on Communication Software and Networks, ICCSN 2010 %O cited By 11; Conference of 2nd International Conference on Communication Software and Networks, ICCSN 2010 ; Conference Date: 26 February 2010 Through 28 February 2010; Conference Code:80255 %K Breadth-first search; Complex data structures; Linear time; Shortest path; Shortest path algorithms; Theoretical computer science; Time algorithms; Two phase; Undirected graph; Weighted graph; Weighted undirected graph, Computer science; Computer software; Data structures; Graph theory; Graphic methods, Algorithms %X 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