Bellman Ford algorithm works, and that it tells if there is a reachable negative cycle. But it does not explicitly name it.Bellman-Ford algorithm reports shortest path only if there is no negative weight cycles. we can Modify it so that it reports minimum distances even if there is a negative weight cycle.