Provided by: International Journal of Computer Applications
Date Added: Jan 2015
Large graphs involving millions of vertices are common in many practical applications and are challenging to process. To process them, the authors present a fundamental Single Source Shortest Path (SSSP) algorithm i.e. Bellman Ford algorithm. Bellman Ford algorithm is a well-known method of SSSP calculation and which is considered to be an optimization problem in the graph. SSSP problem is a major problem in the graph theory that has various applications in real world that demand execution of these algorithms in large graphs having millions of edges and sequential implementation of these algorithms takes large amount of time.