Floyd-Warshall algorithm utilizes __________ to solve the all-pairs shortest paths problem on a directed graph in __________ time.
(A)
Greedy algorithm, θ (V3)
(B)
Greedy algorithm, θ (V2 lgn)
(C)
Dynamic programming, θ (V3)
(D)
Dynamic programming, θ (V2 lgn)
Answer: (C)
Explanation:
Floyd-Warshall algorithm utilizes dynamic programming to solve the all-pairs shortest paths problem on a directed graph in θ (V3) time. For more information on the Floyd-Warshall algorithm.
ReferDynamic Programming | Set 16 (Floyd Warshall Algorithm)
Option (C) is correct.
Quiz of this Question
Please comment below if you find anything wrong in the above post