compute minimum sum of pairs distances between 2 groups of dots
<p>assume we have 2 groups of dots(n red dots and n blue dots). now we want to connect exactly one of blues to exactly one of reds that the sum of connections lines become minimum. Is there any none brute-force suggestion?</p>

<p>thanks in advance</p>