Graph TheoryEasyDirected Graphs and Network Flows
Directed Graphs and Network Flows · Easy problem
A flow network has arcs (capacity ), (capacity ), (capacity ), all carrying no flow yet. The path is pushed to its bottleneck. In the resulting residual graph, what is the capacity of the backward arc ?