UGC-NET | UGC NET CS 2015 Dec – III | Question 20

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 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

My Personal Notes arrow_drop_up

Save