Follow Us :

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

  • 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.
Cancel reply

Your email address will not be published. Required fields are marked *


Cancel reply

Your email address will not be published. Required fields are marked *