title: Python - calculate minimum euclidean distance of two lists of points (coordinates)
body: <p>I have two lists of n shape and each point will be compared(euclidean distance) to each point of the second list and then the minimum distance will be chosen, example:</p>
  
  <p>A: [(1,1),(2,1),(3,1)]</p>
  
  <p>B: [(2,2),(3,3)]</p>
  
  <p>The output will be 3 distances:</p>
  
  <p>min((1,1) -> (2,2),
      (1,1) -> (3,3)),</p>
  
  <p>min( (2,1) -> (2,2),
       (2,1) -> (3,3) ),</p>
  
  <p>min ( (3,1) -> (2,2),
  (3,1) -> (3,3) )</p>
  
  <p>-> euclidean distance</p>
  
  <p>The difficult part is to make an efficient code.</p>