Q23
Which of the following algorithms can be used to find all-pairs shortest paths in a graph?
A.
Dijkstra's Algorithm
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