Question

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. Neither P nor Q
• B. Both P and Q
• C. P only
• D. Q only

Answer 1

The correct option is D Q only

Bellman-Ford shortest path algorithm always finds any negative weighted cycle which is reachable from the source. If the negative weighted cycle is not reachable then, Bellman Ford algorithm not able to find that cycle.