Network Fow A cut is,n is a partition of the vertex set Vinto two subsets Sand Tsuch that seS and te 7.The capacity of the cut{S,乃，denoted by d(S,T),is c(S,T)=∑c(4,) UES,VET The flow across the cut{S,刀，denoted by(S,刀，is f(S,T)=∑f(u,) 1l∈S,veT Thus,the flow across the cut is,n is the sum of the positive flow on edges from Sto Tminus the sum of the positive flow on edges from Tto S.Network Flow ◼ A cut {S, T} is a partition of the vertex set V into two subsets S and T such that sS and tT. The capacity of the cut {S, T}, denoted by c(S, T), is , ( , ) ( , ) u S v T c S T c u v   =  ◼ The flow across the cut {S, T}, denoted by f(S, T), is , ( , ) ( , ) u S v T f S T f u v   =  ◼ Thus, the flow across the cut {S, T} is the sum of the positive flow on edges from S to T minus the sum of the positive flow on edges from T to S