title: Finding minimum cut edges in a graph
body: <p>Given a random undirected graph, I must find 'bottleneck edges' (edit: minimum cut edges) to get from one vertex to another.</p>
  
  <p>What I call 'bottleneck edges' (edit: minimum cut edges) -- 
  suppose I have the following undirected graph:</p>
  
  <pre><code>    A
    / | \
   B--C--D
   |     |
   E--F--G
    \ | /
      H
  </code></pre>
  
  <p>To get from A to H independently of the chosen path edges BE and DG must always be traversed, therefore making a 'bottleneck' (edit: minimum cut).</p>
  
  <p>Is there a polynomial time algorithm for this?</p>