Algorithms | Dynamic Programming | Question 7

Last Updated :
Discuss
Comments

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

θ(n2)

θ(n2 log n)

θ(n3)

θ(n3 log n)

This question is part of this quiz :

Top MCQs on Dynamic Programming with Answers
Tags:
DSA Quiz
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy