MathCastle
Graph TheoryEasyDirected Graphs and Network Flows

Directed Graphs and Network Flows · Easy problem

A flow network has arcs s→as\to a (capacity 55), a→ba\to b (capacity 22), b→tb\to t (capacity 66), all carrying no flow yet. The path s→a→b→ts\to a\to b\to t is pushed to its bottleneck. In the resulting residual graph, what is the capacity of the backward arc b→ab\to a?