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
Share your thoughts in the comments
Please Login to comment...