Gate CS-2013 Question Paper With Solutions

Q. 19 What is the time complexity of Bellman-Ford single-source shortest path algorithm
on a complete graph of n vertices?

 

Gate CS-2013 Question Paper With Solutions

Answer: (C)

Explanation:

Gate CS-2013 Question Paper With Solutions

Learn More:   Gate EE-2016-2 Question Paper With Solutions

LEAVE A REPLY

Please enter your comment!
Please enter your name here