10.04.2026 | Network Flow
In the study of Network Flow, the Ford-Fulkerson algorithm relies on constructing a Residual Network $R_f$ from an original flow network $G$ and a valid flow $f$ . Below is the Residual Graph ( $R_f$ ) generated from an unknown flow network. Which of the following pairs of Original Network $G$ (left) and Flow $f$ (right) correctly generated the Residual Graph above? Pair I: Pair II: Pair III: Pair IV: The alternative that represents the correct statement is: a) Only pair II is correct. b) Only pairs I and III are correct. c) Only pairs II and IV are correct. d) Only pair I is correct. e) None of the above. Original idea by: Yuri S. Costa