Which of the following technique is used to find all pair shortest path in a graph?
(A) Divide and conquer
(B) Greedy
(C) Dynamic programming
(D) All of these.


Answer: (C)

Explanation: Bellman-Ford which is dynamic programming technique is used to find all the shortest path in a graph.
So, option (C) is correct.

Quiz of this Question