Google News
logo
Algorithm - Quiz(MCQ)
What is the time complexity of Floyd–Warshall algorithm to calculate all pair shortest path in a graph with n vertices?
A)
Theta(n^4)
B)
Theta(n^3)
C)
O(n^2logn)
D)
Theta(n^2logn)

Correct Answer : Option (B) :   Theta(n^3)

Advertisement