The Floyd-Warshall algorithm for all-pair shortest paths computation is based on

GATE · 2016 · CS · Set 2 · Computer Science & IT

1. A.

   Greedy paradigm.

2. B.

   Divide-and-Conquer paradigm.

3. C.

   Dynamic Programming paradigm.

4. D.

   neither Greedy nor Divide-and-Conquer nor Dynamic Programming paradigm.

Attempted by 1049 students.