GATE Exam | Aptitude Questions | GATE Syllabus | GATE Result | Mock Test | GATE Preparation
0 votes

Which of the following statement(s)is / are correct regarding Bellman-Ford shortest path algorithm?

P: Always finds a negative weighted cycle, if one exist s.
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

asked in Graph search, minimum spanning trees, shortest paths by gate

1 Answer

0 votes
Finds whether any negative weighted cycle is reachable from the source
answered by gate

Related questions

The best answer to any question