Question

Floyed-Warshall algorithm utilizes_______ to solve the all-pairs shortest paths problem on a directed graph in _____time.

• A. $Greedyalgorithm,⊝\left(V^{2}logn\right)$
• B. $Dynamicprogramming,⊝\left(V^{2}logn\right)$
• C. $Greedyalgorithm,⊝\left(V^3\right)$
• D. $Dynamicprogramming,⊝\left(V^3\right)$

Answer 1

The correct option is D $Dynamicprogramming,⊝\left(V^3\right)$

Floyd-Warshall algorithm utilizes dynamic programming to solve the all-pairs shortest paths problem on a directed graph in $⊝\left(V^3\right)$ time.
So, option (C) is correct.