GATE 2020
November 11, 2023Question 9794 – Secondary-Storage
November 11, 2023Algorithms
|
Question 42
|
Which one of the following algorithm design techniques is used in finding all pairs of shortest distances in a graph?
|
Dynamic programming
|
|
|
Backtracking
|
|
|
Greedy
|
|
|
Divide and Conquer
|
Question 42 Explanation:
In Dynamic programming Floyd Warshall algorithm is used to calculate the all pairs shortest path distance.
Correct Answer: A
Question 42 Explanation:
In Dynamic programming Floyd Warshall algorithm is used to calculate the all pairs shortest path distance.