Network Flow
Problem1 A G(V, E), with each edge is capacity $C_e$.
The is source s $\in$ and sink t $\in$ V.
No edge enter and and no edge leaving t.
Flow is defined as function f that take the edge and return a nonnegative real number, $f: E \rightarrow R^+$
Subjects to following constraints
$0 \leq f(e) \leq c_e$ $\sum_{e\ into\ v} f(e) = \sum_{e\ out\ of v} f(e)$ or $f^{out}(v) = f^{in}(v)$ GOAL: find the maximum flow.……