E is the number of edges in the graph and f is maximum flow in the graph. When the capacities are integers, the runtime of Ford-Fulberson algorithm is bounded by :
Pick an option to check yourself, or open the answer below.
Show answer & explanation
Correct answer: A. O(E · f)
Explanation
With integer capacities each augmentation raises the flow by at least 1, and each costs O(E): O(E · f).
More Data Structures and Algorithms questions
- Consider a hash table of size seven, with starting index zero, and a hash function (7x+3) mod 4. Assuming the hash table is initially empty…
- Consider a Boolean function of ‘n’ variables. The order of an algorithm that determines whether the Boolean function produces a output 1 is…
- A 5-ary tree is tree in which every internal node has exactly 5 children. The number of left nodes in such a tree with 8 internal nodes wil…
- The maximum number of comparisons needed to sort 9 items using radix sort is (assume each item is 5 digit octal number) :
- Match the following with respect to algorithm paradigms :
- A binary search tree in which every non-leaf node has non-empty left and right subtrees is called a strictly binary tree. Such a tree with…