Reply To:

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

Home Modern › Forums › ISRO ›

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

› Reply To:

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