title: How to find edge connectivity between 2 given vertex
body: <p>Edge connectivity is minimum number of edge to be removed to divide graph in 2 or more components. As of now I have found an algorithm for edge connectivity irrespective of vertex: <a href="http://www.sanfoundry.com/java-program-find-edge-connectivity-graph/" rel="nofollow">http://www.sanfoundry.com/java-program-find-edge-connectivity-graph/</a></p>
  
  <p>What is the best method I can use to proceed with, to find the edge connectivity between 2 vertices?</p>
  
  <p><strong>Edge Connectivity between 2 vertex(v1, v2) - Means</strong></p>
  
  <p>If cutting any edge/edges in Graph G, generates two components G1 &amp; G2. </p>
  
  <p>Here ( v1 ∈ G1 and v2 ∈ G2 )  <strong>OR</strong>  ( v2 ∈ G1 and v1 ∈ G2 )</p>