Which one of the following algorithm design techniques is used in finding all…
ISRO Scientist/Engineer SC · 2008 · Computer Science
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
Attempted by 912 students.
Sign up free to check your answer
Sign up freeLoading lesson…