- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Does Ford- Fulkerson algorithm use the i...

Q. |
## Does Ford- Fulkerson algorithm use the idea of? |

A. | naïve greedy algorithm approach |

B. | residual graphs |

C. | minimum cut |

D. | minimum spanning tree |

Answer» B. residual graphs | |

Explanation: ford-fulkerson algorithm uses the idea of residual graphs which is an extension of naïve greedy approach allowing undo operations. |

View all MCQs in:
Design and Analysis of Algorithms

- Dinic’s algorithm runs faster than the Ford-Fulkerson algorithm.
- 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.
- Bellmann Ford algorithm is used to indicate whether the graph has negative weight cycles or not.
- 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

Login to Continue

It will take less than 2 minutes

Report MCQ