Max flow

A flow assigns a number to each edge, never above its capacity, and every node except the source and the sink keeps what it receives. The max flow equals the minimum cut: the cheapest set of edges whose removal separates the source from the sink.

Capacities: S→A 10, S→B 5, A→T 7, B→T 8, A→B 3. Enter the maximum flow from S to T.