GATE Exam | Aptitude Questions | GATE Syllabus | GATE Result | Mock Test | GATE Preparation
0 votes

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

A

Greedy paradigm. (C) (D)

B

Divide-and-Conquer paradigm.

C

Dynamic Programming paradigm.

D

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

asked in Algorithm design techniques: greedy, dynamic programming and divide‐and‐conquer by gate

2 Answers

0 votes
Dynamic Programming paradigm.
answered by gate
0 votes
c - Dynamic programming paradigm
answered by anonymous

Related questions

The best answer to any question