DT Q45

Home
DT Q45

0. Which of the following statement(s) is/are correct regarding Bellman-Ford shortest path algorithm?
P. Alvvays finds a negative weighted cycle, if one exists.
Q. Finds whether any negative weighted cycle is reachable from the source

Answer
Comment
Array

Option : B
Explanation :
I n Bellman Ford shortest path algorithm, we choose a node first and then we find any negative weighted cycle is reachable from source.

You must be logged in to post a comment.

You must be logged in to post a comment.

Forgot your password?

I agree with the Terms.