Research Article

Identification of Optimal Path in Power System Network Using Bellman Ford Algorithm

Algorithm 1

Bellman ford ( 𝐺 , 𝑊 , 𝑆 ).
INITIALIZE-SINGLE-SOURCE ( 𝐺 , 𝑆 )
For 𝑖 1 to | 𝑉 [ 𝐺 ] | − 1
 do for each edge ( 𝑢 , 𝑣 ) 𝐸 [ 𝐺 ]
do RELAX ( 𝑢 , 𝑣 , 𝑤 )
for each edge ( 𝑢 , 𝑣 ) 𝐸 [ 𝐺 ]
   do if 𝑑 [ 𝑣 ] > 𝑑 [ 𝑢 ] + 𝑤 ( 𝑢 , 𝑣 )
  then return FALSE
return TRUE