Anonymous user menu

Gate1998_1.21

Which one of the following algorithm design techniques is used in finding all pairs of shortest distances in a graph?
(a) Dynamic programming
(b) Backtracking
(c) Greedy
(d) Divide and Conquer

Answer

Discuss

0Comment