Extended Bellman Ford Algorithm with Optimized Time of Computation

Large graphs having millions of vertices frequently used in many practical applications and are complicated to process. To process them, some fundamental single source shortest path (SSSP) algorithms like Dijkstra algorithm and Bellman Ford algorithm are available. Dijkstra algorithm is a competent sequential access algorithm but poorly suited for parallel architecture, whereas Bellman Ford algorithm is suited for parallel execution but this feature come at a higher cost. This paper introduces a new algorithm EBellflaging algorithm which enhances basic Bellman Ford algorithm to improve its efficiency over traditional Dijkstra algorithm and Bellman Ford algorithm and also reduces the space requirement of both the traditional approaches.