Network flow black technology

The minimum flow of S->T is the maximum flow of T->S

Maximize the flow of an edge (assuming x -> y): delete this edge and run the maximum flow with y as S x as T

Maximize the flow of a point: split this point into S and T to run the maximum flow