Which of the following statement(s) is/are correct regarding Bellman-Ford…
GATE · 2009 · CS
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.
P only
- B.
Q only
- C.
both P and Q
- D.
neither P nor Q
Attempted by 425 students.
Show answer
Correct answer: B
The worked solution is available to enrolled students.
Video solution available to enrolled students.
Explore the full course: Iocl Engineers Officers Grade A Paper 2
Loading lesson…