- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Floyd Warshall Algorithm can be used for...

Q. |
## Floyd Warshall Algorithm can be used for finding |

A. | single source shortest path |

B. | topological sort |

C. | minimum spanning tree |

D. | transitive closure |

Answer» D. transitive closure | |

Explanation: one of the ways to compute the transitive closure of a graph in theta(n3) time is to assign a weight of 1 to each edge of e and then run the floyd warshall algorithm. |

View all MCQs in:
Design and Analysis of Algorithms

- Floyd Warshall’s Algorithm can be applied on
- Floyd Warshall’s Algorithm is used for solving
- What is the running time of the Floyd Warshall Algorithm?
- What approach is being followed in Floyd Warshall Algorithm?
- 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?
- What happens when the value of k is 0 in the Floyd Warshall Algorithm?
- 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?

Login to Continue

It will take less than 2 minutes

Report MCQ