Q37
Which of the following graph algorithms is used to find the shortest path between all pairs of vertices?
A.
Depth-First Search (DFS)
B.
Bellman-Ford Algorithm
C.
Kruskal's Algorithm
D.
Floyd-Warshall Algorithm
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board