network flow

Question 1

method to find network flow

Answer 1

use initial flow=0 or some given flow, then flow augmentation
how much more can be sent>
how much can be reduced <

Question 2

minimum cut = ?

Answer 2

min cut = max flow
so max flow <or= any cut

Question 3

drawing cuts

Answer 3

cut cannot intersect any arc more than once

Question 4

value of a cut

Answer 4

source side to sink side maximum
- sink to source side minimum