title: Network Flow: Adding a new edge
body: <p>In the recent time in one of the compition I have been asked to design an algorithm that, <code>for a network having V vertices and E edges, if by adding an edge (it's capacity should be 1) results in increase the maximum flow.</code> that is we have to design such an algoritm to find such edges. </p>
  
  <p>Algorithm should be faster then <code>O(|E|* h(|V||E|))</code> where <code>h(|V||E|)</code> is time taken in computing maximum flow.</p>
  
  <p>Thanks in advance. Let me know if it is unclear.</p>