Floyd-Warshall algorithm utilizes _____ to solve the all-pairs shortest paths…
UGC NET 2015
Floyd-Warshall algorithm utilizes _____ to solve the all-pairs shortest paths problem on a directed graph in ____ time.
- A.
Greedy algorithm, 𝜃(𝑉3)
- B.
Greedy algorithm, 𝜃(𝑉2 𝑙𝑔𝑛)
- C.
Dynamic programming, 𝜃(𝑉3)
- D.
Dynamic programming, 𝜃(𝑉2 𝑙𝑔𝑛)
Attempted by 423 students.
Sign up free to check your answer
Sign up freeLoading lesson…

