st-cut
programming
st-cut
Given a flow network $(G, c, s, t)$ an st-cut is a cut $(L, R)$ of $G$ where $s \in L$ and $t \in R$. The capacity of this cut is
$$capacity(L,R) = \sum_{\substack{(v,w) \in E\\ v \in L, w \in R}} c(v,w).$$Given a flow network $(G, c, s, t)$ an st-cut is a cut $(L, R)$ of $G$ where $s \in L$ and $t \in R$. The capacity of this cut is
$$capacity(L,R) = \sum_{\substack{(v,w) \in E\\ v \in L, w \in R}} c(v,w).$$