wiz-icon
MyQuestionIcon
MyQuestionIcon
1
You visited us 1 times! Enjoying our articles? Unlock Full Access!
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
No worries! We‘ve got your back. Try BYJU‘S free classes today!
B
Both P and Q
No worries! We‘ve got your back. Try BYJU‘S free classes today!
C
P only
No worries! We‘ve got your back. Try BYJU‘S free classes today!
D
Q only
Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses
Join BYJU'S Learning Program
CrossIcon