Floyd-Warshall algorithm utilizes __________ to solve the all-pairs shortest paths problem on a directed graph in __________ time.
(A) Greedy algorithm, θ (V³)
(B) Greedy algorithm, θ (V² lgn)
(C) Dynamic programming, θ (V³)
(D) Dynamic programming, θ (V² lgn)


Answer: (C)

Explanation: Floyd-Warshall algorithm utilizes dynamic programming to solve the all-pairs shortest paths problem on a directed graph in θ (V³) time.
For more information on Floyd-Warshall algorithm ReferDynamic Programming | Set 16 (Floyd Warshall Algorithm)
Option (C) is correct.

Quiz of this Question