title: Algorithms: max flow problem and s-t minimum cut
body: <p>Let G be an input graph to the max flow problem. Let A be a minimum s-t cut
  in the graph. Suppose we add 1 to the capacity of every edge in the graph. Is it necessarily
  true that A is still a minimum cut? If so, prove it, if not give a counterexample</p>
  
  <p>[Note: I think the answer is no, not necessarily, but I cannot come up with a counterexample]
  Please note that this is a homework question, I am looking for a hint or any help I can get :)</p>