This is the problem minimum-cost-to-connect-two-groups-of-points, please go through it. I'm stuck at this point:
1. At each level (here each level mean each point in group 1) if I'm iterating different subgroups of group2 to connect, how to efficiently calculate the cost for the new connections excluding the connections already connected in previous level?
2. Or is there another way to do it?