Let's start out by reviewing max-flow min-cut, as well as the flow networks they operate on.
Let $G = (V,E)$ be a flow network. Prove a minimum cut is also a minimum-capacity cuts of $G$.
Thanks for any help, this problem has been throwing me for a loop!
Note: NOT homework, extra problems from our book I'm working through for exam preparation.