Flow network

A flow network contains the following data:

• A directed graph $G = (V,E)$,
• An edge weighting $c: E \rightarrow \mathbb{R}_{\geq0}$ called the capacity,
• A source $s \in V$, and
• A sink $t \in V$. This can be summarised as $(G, c, s, t)$.