Algorithms | Dynamic Programming | Question 7

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

(A)

θ(n²)

(B)

θ(n² log n)

(C)

θ(n³)

(D)

θ(n³ log n)

Answer: (C)
Explanation:

Time complexity of Bellman-Ford algorithm is O(VE) where V is number of vertices and E is number of edges. For a complete graph with n vertices, V = n, E = O(n²). So overall time complexity becomes O(n³)

Quiz of this Question
Please comment below if you find anything wrong in the above post