Q.

What happens when the value of k is 0 in the Floyd Warshall Algorithm?

A. 1 intermediate vertex
B. 0 intermediate vertex
C. n intermediate vertices
D. n-1 intermediate vertices
Answer» B. 0 intermediate vertex
Explanation: when k=0, a path from vertex i to vertex j has no intermediate vertices at all. such a path has at most one edge and hence dij(0) = wij.
787
0
Do you find this helpful?
1

View all MCQs in

Design and Analysis of Algorithms

Discussion

No comments yet

Related MCQs