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
Answer: (A)
Explanation:
Quiz of this Question
Please comment below if you find anything wrong in the above post
Whether you're preparing for your first job interview or aiming to upskill in this ever-evolving tech landscape,
GeeksforGeeks Courses are your key to success. We provide top-quality content at affordable prices, all geared towards accelerating your growth in a time-bound manner. Join the millions we've already empowered, and we're here to do the same for you. Don't miss out -
check it out now!