function bellman Ford(G, S) for each vertex V in G distance[V] <- infinite previous [V] <- NULL distance[S] <- 0 for each vertex V in G for each edge (U,V) in G tempDistance <- distance[U] + edge_weight(U, V) if tempDistance < distance[V] distance[V] <- tempDistance previous [V] <- U for each edge (U,V) in G If distance[U] + edge_weight(U, V) < distance[V} Error: Negative Cycle Exists return distance[], previous] Drawbacks of Bellman ford algorithm o The bellman ford algorithm does not produce a correct answer if the sum of the edges of a cycle is negative. Let's