What we mean when we say ‘network flow problem’is the maximization of flow between the source and sink on a collection of nodes connected with unidirectional pipes.
The source is a node with infinite flow available, and is denoted by a plus symbol.
The sink is a node with an insatiable appetite for flow, and is denoted by a minus symbol.
Each pipe has a given maximum capacity above which flow cannot be increased.