1.

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»


Discussion

No Comment Found

Related InterviewSolutions