The maximal flow algorithm
A) does not require flow on every branch for the final solution.
B) may end with capacity remaining at the source.
C) may end with capacity at those nodes leading immediately to the destination.
D) all of the above

Question

Quizplus · Accepted Answer

The maximal flow algorithm does not require flow on every branch for the final solution (A), it may end with capacity remaining at the source (B), and it may end with capacity at those nodes leading immediately to the destination (C). Therefore, all of the above choices are correct.

The Maximal Flow Algorithm