MCQs>IT & Programming>Data Structures And Algorithms>What is the worst-case time complexity of the simple Ford-Fulkerson algorithm for finding the maximum flow in a graph given a source and a sink, and all integer capacities on edges? Assume the graph G = (V,E) has a finite, integer maximum flow value of f.
Data Structures And Algorithms MCQs
What is the worst-case time complexity of the simple Ford-Fulkerson algorithm for finding the maximum flow in a graph given a source and a sink, and all integer capacities on edges? Assume the graph G = (V,E) has a finite, integer maximum flow value of f.
Answer
Correct Answer: O(|E|f)
Explanation:
Note: This Question is unanswered, help us to find answer for this one