Bellman Ford algorithm

Question

Consider the statements True/ False

Bellman Ford algorithm reports a shortest path from source to a destination only in a directed graph which has a negative cycle.

Comments

https://stackoverflow.com/questions/14785413/can-we-apply-bellman-ford-algorithm-to-undirected-graph

---

False.

BF works for undirected graphs also only condition is it shouldn't have negative wt cycle.

Answer 1

Bellman ford only finds whether a negative weight cycle is reachable from source or not.