Comments by Gengou (Top 4 by date)

thanks for help :P i'll try to figure it out

yes but that's not helping at all. Because of the last pair of points which distance is too long, the sum can be much smaller. I followed that algorithm but doesn't apply for my problem. I need something else. Recursive backtracking could be a solution but my teacher said there is a more efficient way. And I don't know what to start with now...

Sorry for my english and thanks for reply.
So i have exactly 2*n random points. My goal is to connect every two points (if i have points A, B, C, D for example, i can connect A with C and B with D, supossing that sum of AC+BD is smaller than AB+CD and AD+BC). So every single point must be connected to a single point. This means exactly n lines. And the sum of those lines must be as small as possible. Just run the program and you fill figure it out what I mean when u see the lines.
Thanks again for reply,