Question

Which of the statements below is true? *
The Edmonds-Karp algorithm is always faster than the Ford-Fulkerson algorithm.
The sum of the capacities of the edges of a network equals the sum of the capacities of the edges of any residual network.
The Ford-Fulkerson algorithms runs in polynomial time on graphs with unit edge capacities.

Answer 1

The graph for the equation y=-1 is a straight line passing through -1 and parallel to x axis.

The graph for the equation y=3 is a straight line passing through 3 and parallel to x axis.