Find some maximum flow from \(s\) to \(t\) in the depicted network.
A maximum flow of size 14 can be found. One of the possible ones is in the following figure:
A possible minimum cut consists of red edges.
A maximum flow of size 11 can be found. One of the possible ones is in the following figure:
The minimum cut consists, for example, of the edges stemming out from the source.
