Which of the following algorithm design technique is used in finding all pairs…
GATE · 1998 · CS · Question 1 subparts
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 697 students.
Sign up free to check your answer
Sign up freeLoading lesson…