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?
- A.
AK (i, j) = min{ AK-1 (i, K) + AK-1 (K, j), AK-1 (i, j)}
- B.
AK (i, j) = min{ A K+1 (i, K) + A K+1 (K, j), A k+1 (i, j)}
- C.
A K (i, j) = min{ Aj-1 (i, K) + Aj-1 (K, j), A j-1 (i, j)}
- 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 freeLoading lesson…