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
Whether you’re preparing for your first job interview or aiming to upskill in this ever-evolving tech landscape, neveropen Courses are your key to success. We provide top-quality content at affordable prices, all geared towards accelerating your growth in a time-bound manner. Join the millions we’ve already empowered, and we’re here to do the same for you. Don’t miss out – check it out now!
… [Trackback]
[…] Find More to that Topic: geeksforgeeks.org/algorithms-analysis-of-algorithms-question-12/ […]
… [Trackback]
[…] Read More on on that Topic: geeksforgeeks.org/algorithms-analysis-of-algorithms-question-12/ […]
… [Trackback]
[…] Here you will find 44455 additional Info on that Topic: geeksforgeeks.org/algorithms-analysis-of-algorithms-question-12/ […]
… [Trackback]
[…] Read More Info here on that Topic: geeksforgeeks.org/algorithms-analysis-of-algorithms-question-12/ […]