McqMate

Q. |
## Bellmann Ford algorithm is used to indicate whether the graph has negative weight cycles or not. |

A. | true |

B. | false |

Answer» A. true | |

Explanation: bellmann ford algorithm returns true if the graph does not have any negative weight cycles and returns false when the graph has negative weight cycles. |

831

0

Do you find this helpful?

6

View all MCQs in

Design and Analysis of AlgorithmsNo comments yet

- The running time of Bellmann Ford algorithm is lower than that of Dijkstra’s Algorithm.
- Dijikstra’s Algorithm is more efficient than Bellmann Ford Algorithm.
- Bellmann ford algorithm provides solution for problems.
- What is the running time of Bellmann Ford Algorithm?
- How many times the for loop in the Bellmann Ford Algorithm gets executed?
- What is the basic principle behind Bellmann Ford Algorithm?
- Bellmann Ford Algorithm can be applied for
- Bellmann Ford algorithm was first proposed by
- Bellmann Ford Algorithm is an example for
- Consider a undirected graph G with vertices { A, B, C, D, E}. In graph G, every edge has distinct weight. Edge CD is edge with minimum weight and edge AB is edge with maximum weight. Then, which of the following is false?