In a flow network, the sink is the destination vertex: flow arrives there through incoming edges, and it has no outgoing edges. The maximum-flow problem aims to maximize the total flow delivered to the sink. section 18.4.1
The network diagram illustrates a sink as the endpoint of flow. section 18.4.1


