Bellmann Ford algorithm is used to indicate whether the graph has negative weight cycles or not.
(a) True
(b) False
I had been asked this question in an online interview.
My question comes from Shortest Path topic in division Shortest Path of Data Structures & Algorithms II