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


Answer: (C)

Explanation:

Quiz of this Question


  • Last Updated : 25 Dec, 2018

Share your thoughts in the comments