CameraIcon
CameraIcon
SearchIcon
MyQuestionIcon
MyQuestionIcon
1
You visited us 1 times! Enjoying our articles? Unlock Full Access!
Byju's Answer
Standard VII
Mathematics
Consecutive Numbers
Which of the ...
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
Open in App
Solution

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.

flag
Suggest Corrections
thumbs-up
0
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
MATHEMATICS
Watch in App
explore_more_icon
Explore more
Consecutive Numbers
Standard VII Mathematics
Join BYJU'S Learning Program
book_image
Solve
book_image
Textbooks
book_image
Question Papers
book_image
Install app
CrossIcon