Q. 2 Which of the following statement(s) is/are correct regarding Bellman-Ford
shortest path algorithm ?
P. Always finds a negative weighted cycle, if one exists. Q. Finds whether any negative weighted cycle is reachable from the source
(A) P only
(B) Q only
(C) Both P and Q
(D) Neither P nor Q
Answer: (B)
Explanation:
