Chapter number or note title: Chapter 10: Maximum Flows & Minimum Cuts
Page number: 344-345
Error description: The exercise suggests a way to resolve anti-parallel edges in a flow network while preserving the max flow value of the graph. But suppose the network consists of 2 vertices s & t, and edges s->t and t->s of capacity 1. Clearly the max flow in this network is 1, but following what's described in the exercise leads to a network with no edges and thus max flow 0.
Suggested fix (if any): not sure what was intended for this exercise.
Chapter number or note title: Chapter 10: Maximum Flows & Minimum Cuts
Page number: 344-345
Error description: The exercise suggests a way to resolve anti-parallel edges in a flow network while preserving the max flow value of the graph. But suppose the network consists of 2 vertices s & t, and edges s->t and t->s of capacity 1. Clearly the max flow in this network is 1, but following what's described in the exercise leads to a network with no edges and thus max flow 0.
Suggested fix (if any): not sure what was intended for this exercise.