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.

  1. A.

    Greedy algorithm, 𝜃(𝑉3)

  2. B.

    Greedy algorithm, 𝜃(𝑉2 𝑙𝑔𝑛)

  3. C.

    Dynamic programming, 𝜃(𝑉3)

  4. D.

    Dynamic programming, 𝜃(𝑉2 𝑙𝑔𝑛)

Attempted by 423 students.

Sign up free to check your answer

Sign up free

Explore the full course: Uppsc Polytechnic Lecturer 2025 Cs

Loading lesson…