Q.24 The Floyd-Warshall algorithm for all-pair shortest paths computation is based on:
(A) Greedy paradigm.
(B) Divide-and-Conquer paradigm.
(C) Dynamic Programming paradigm.
(D) neither Greedy nor Divide-and-Conquer nor Dynamic Programming paradigm.
Answer: (C)
Explanation:
