Q14
How does the Floyd-Warshall algorithm compute shortest paths in a graph?
A.
By applying dynamic programming only once.
B.
By performing DFS from each vertex.
C.
By considering all pairs of vertices and iteratively updating shortest paths.
AnswerD.
By using a priority queue for edge relaxation.
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board