Concept drill

negative-cycle

GATE CSE & IT · Graph Algorithms · 2009-2009

PYQs

100%

keyed

elite explanations

years appeared

Study anchor

Cormen et al. — Introduction to Algorithms (CLRS)

Algorithms, data structures, graph algorithms, complexity

Practice action

Start latest PYQ

PYQs in this concept

All concepts →

2009 PYQ

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...

mediumanswer key