BELLMAN - FORD “ALGORITHUM”

SUBMITTED BY:- (1) GAURAV KUMAR (12500217062)

(2) DIVYESH ANSHU (12500217065)
(3) ADARSH KUMAR (125002170 )

UNDER THE GUIDANCE OF:- SATENDER VYASH

COTENTS
 1:- INTRODUCTION
 2:-
INTRODUCTION

 The Bellman Ford Algorithm is an algorithm that compute the shortest

paths form a single source vertex to all of the other vertex in a
weighted digraph. It is slower than Dijkstra’s algorithm for the some
problem, but more versatile, as it is capable of handling graphs in
which some of the edge weight are negative number. The algorithm
was first proposed by Alfonso Shimbel (1955), but is instead named
after Richard Bellman and Lester Ford, Jr., Who published it in 1958 and
1956, respectively.
 Edward F. Moore also published the same algorithm in 1957 and for this
reason it is also sometimes called the Bellman-Ford-Moore algorithm.
NEGATIVE-WEIGHT CYCLES:-
CORRECTNESS

THEOREM :- If G=(V , E)
contain no negative
weight cycle, then
after the Bellman Ford
algorithm executes,
d[v]= ∂(s , v) for all v€v
ANY QUERY ?

THANK YOU!!