McqMate

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 AlgorithmsNo comments yet

- Floyd Warshall’s Algorithm is used for solving
- Floyd Warshall’s Algorithm can be applied on
- What is the running time of the Floyd Warshall Algorithm?
- What approach is being followed in Floyd Warshall Algorithm?
- Floyd Warshall Algorithm can be used for finding
- What procedure is being followed in Floyd Warshall Algorithm?
- Floyd- Warshall algorithm was proposed by
- Who proposed the modern formulation of Floyd-Warshall Algorithm as three nested loops?
- Which algorithm is the most efficient numerical algorithm to obtain lcm?
- Is Coppersmith-Winograd algorithm better than Strassen’s algorithm in terms of time complexity?