Skip to content
Related Articles
Get the best out of our app
GFG App
Open App
geeksforgeeks
Browser
Continue

Related Articles

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

Improve Article
Save Article
Like Article
Improve Article
Save Article
Like Article

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

My Personal Notes arrow_drop_up
Last Updated : 11 Jun, 2018
Like Article
Save Article
Similar Reads