- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Floyd Warshall’s Algorithm can be applie...

Q. |
## Floyd Warshall’s Algorithm can be applied on |

A. | undirected and unweighted graphs |

B. | undirected graphs |

C. | directed graphs |

D. | acyclic graphs |

Answer» C. directed graphs | |

Explanation: floyd warshall algorithm can be applied in directed graphs. from a given directed graph, an adjacency matrix is framed and then all pair shortest path is computed by the floyd warshall algorithm. |

View all MCQs in:
Design and Analysis of Algorithms

- Floyd Warshall Algorithm can be used for finding
- 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?
- Bellmann Ford Algorithm can be applied for
- Which algorithm is the most efficient numerical algorithm to obtain lcm?

Login to Continue

It will take less than 2 minutes

Report MCQ