title: Python "round robin"
body: <p>Given multiple (x,y) ordered pairs, I want to compare distances between each one of them.
  So pretend I have a list of ordered pairs:</p>
  
  <pre><code>pairs = [a,b,c,d,e,f]
  </code></pre>
  
  <p>I have a function that takes two ordered pairs and find the distance between them:</p>
  
  <pre><code>def distance(a,b):
      from math import sqrt as sqrt
      from math import pow as pow
      d1 = pow((a[0] - b[0]),2)
      d2 = pow((a[1] - b[1]),2)
      distance = sqrt(d1 + d2)
      return distance
  </code></pre>
  
  <p>How can I use this function to compare every ordered pair to every other ordered pair, ultimately finding the two ordered-pairs with the greatest distance between them?</p>
  
  <p>Psuedopsuedocode:  </p>
  
  <pre><code>     distance(a,b)
       distance(a,c)
       ...
       distance(e,f)
  </code></pre>
  
  <p>Any help would be tremendously appreciated.</p>