Fundamental Theorem of Flow .Flow network:D(V,E),s,t∈V,andc:E→R≥0 ·Max-flow=min-cut 、With integral capacity c:E→Z≥o,the maximum flow is achieved by an integer flow f:E→Z≥o- 0/1 01 0/1 0/3 S 0/3 0/4 0/1• Flow network: , , and • Max-flow = min-cut • With integral capacity , the maximum flow is achieved by an integer flow . D(V, E) s, t ∈ V c : E → ℝ≥0 c : E → ℤ≥0 f : E → ℤ≥0 Fundamental Theorem of Flow s t 0/1 0/4 0/1 0/1 0/1 0/1 0/1 0/4 0/3 0/3