The Gateway to Engineering Excellence
0 votes
12 views

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.

  1. $P$ only
  2. $Q$ only
  3. Both $P$ and $Q$
  4. Neither $P$ nor $Q$
in Algorithms by (185 points) 2 7 | 12 views

Please log in or register to answer this question.

Top Users Mar 2019
  1. gatefan

    185 Points

  2. southdelhi

    152 Points

  3. gfjacob

    102 Points

  4. 1995ankur

    100 Points

  5. mohan

    100 Points

₹ 500 Amazon Gift Card for Monthly top user

Recent Badges

Trouper gfjacob
Visitor gfjacob
Regular southdelhi
Verified Human gfjacob
100 Club gfjacob
100 Club 1995ankur
16 questions
0 answers
0 comments
75 users