Which of the following algorithm design technique is used in finding all pairs…
PYQ GATE 1998
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
Attempted by 891 students.
Sign up free to check your answer
Sign up freeLoading lesson…