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?

Answer: (C)

Explanation: