Which of the following algorithm design technique is used in finding all pairs of shortest distances in a graph?
(A) Dynamic programming
(B) Backtracking
(C) Greedy
(D) Divide and Conquer
Answer: (A)
Explanation:
Quiz of this Question
Please comment below if you find anything wrong in the above post
Aptitude | GATE CS 1998 | Question 21
Recommended Articles