What is the correct recurrence relation for all pair shortest path using…

What is the correct recurrence relation for all pair shortest path using floyd-warshall algorithm is?

  1. A.

    AK (i, j) = min{ AK-1 (i, K) + AK-1 (K, j), AK-1 (i, j)}

  2. B.

     AK (i, j) = min{ A K+1 (i, K) + A K+1 (K, j), A k+1 (i, j)}

  3. C.

     A K (i, j) = min{ Aj-1 (i, K) + Aj-1 (K, j), A j-1 (i, j)}

  4. D.

    A K (i, j) = min{ A j+1 (i, K) + A j+1 (K, j), A j+1 (i, j)}

Attempted by 93 students.

Sign up free to check your answer

Sign up free

Explore the full course: Algorithms

Loading lesson…