2026-341

 In the study of Network Flow, the Ford-Fulkerson algorithm relies on constructing a Residual Network  from an original flow network  and a valid flow . Below is the Residual Graph () generated from an unknown flow network.

Which of the following pairs of Original Network  (left) and Flow  (right) correctly generated the Residual Graph above?

Pair I:

Pair II:

Pair III:

Pair IV:

The alternative that contains a correct statement is:

1. Only pair II is correct.
2. Only pairs I and III are correct.
3. Only pair I is correct.
4. Only pairs II and IV are correct.
5. None of the above.

Original idea by: Yuri S. Costa