Open In App

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

Algorithms | Analysis of Algorithms | Question 12

What is the time complexity of Floyd–Warshall algorithm to calculate all pair shortest path in a graph with n vertices?

(A)



O(n2log(n))

(B)



Theta(n2log(n))

(C)

Theta(n4)

(D)

Theta(n3)

Answer: (D)
Explanation:

Floyd–Warshall algorithm uses three nested loops to calculate all pairs shortest path. So, the time complexity is Theta(n3).
Please read here for more details.

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

Article Tags :
DSA Quiz
Recommended Articles
1. Algorithms | Analysis of Algorithms (Recurrences) | Question 1
2. Algorithms | Analysis of Algorithms (Recurrences) | Question 2
3. Algorithms | Analysis of Algorithms | Question 2
4. Algorithms | Analysis of Algorithms | Question 3
5. Algorithms | Analysis of Algorithms | Question 4
6. Algorithms | Analysis of Algorithms | Question 5
7. Algorithms | Analysis of Algorithms | Question 19
8. Algorithms | Analysis of Algorithms | Question 19
9. Algorithms | Analysis of Algorithms (Recurrences) | Question 4
10. Algorithms | Analysis of Algorithms | Question 8
11. Algorithms | Analysis of Algorithms | Question 9
12. Algorithms | Analysis of Algorithms | Question 10
13. Algorithms | Analysis of Algorithms | Question 11
14. Algorithms | Analysis of Algorithms (Recurrences) | Question 11
15. Algorithms | Analysis of Algorithms (Recurrences) | Question 6
16. Algorithms | Analysis of Algorithms | Question 13
17. Algorithms | Analysis of Algorithms (Recurrences) | Question 7
18. Algorithms | Analysis of Algorithms (Recurrences) | Question 8
19. Algorithms | Analysis of Algorithms | Question 15
20. Algorithms | Analysis of Algorithms (Recurrences) | Question 9
21. Algorithms | Analysis of Algorithms | Question 17
22. Algorithms | Analysis of Algorithms | Question 18
23. Algorithms | Analysis of Algorithms (Recurrences) | Question 11
24. Algorithms | Analysis of Algorithms (Recurrences) | Question 11
25. Algorithms | Analysis of Algorithms | Question 19