Vidyalelo
Data Structure · Q152

Graph Algorithms (DFS, BFS, Dijkstras, etc)

Programming · Data Structure · question 152

Q152

What is the running time of the Floyd Warshall Algorithm?

A.
Big-oh(V)
B.
Theta(V2)
C.
Big-Oh(VE)
D.
Theta(V3)
Answer

Answer: Option D

Solution

Answer: Option D
No explanation is given for this question Let's Discuss on Board