16,008,719 members
Sign in
Sign in
Email
Password
Forgot your password?
Sign in with
home
articles
Browse Topics
>
Latest Articles
Top Articles
Posting/Update Guidelines
Article Help Forum
Submit an article or tip
Import GitHub Project
Import your Blog
quick answers
Q&A
Ask a Question
View Unanswered Questions
View All Questions
View C# questions
View C++ questions
View Javascript questions
View Visual Basic questions
View .NET questions
discussions
forums
CodeProject.AI Server
All Message Boards...
Application Lifecycle
>
Running a Business
Sales / Marketing
Collaboration / Beta Testing
Work Issues
Design and Architecture
Artificial Intelligence
ASP.NET
JavaScript
Internet of Things
C / C++ / MFC
>
ATL / WTL / STL
Managed C++/CLI
C#
Free Tools
Objective-C and Swift
Database
Hardware & Devices
>
System Admin
Hosting and Servers
Java
Linux Programming
Python
.NET (Core and Framework)
Android
iOS
Mobile
WPF
Visual Basic
Web Development
Site Bugs / Suggestions
Spam and Abuse Watch
features
features
Competitions
News
The Insider Newsletter
The Daily Build Newsletter
Newsletter archive
Surveys
CodeProject Stuff
community
lounge
Who's Who
Most Valuable Professionals
The Lounge
The CodeProject Blog
Where I Am: Member Photos
The Insider News
The Weird & The Wonderful
help
?
What is 'CodeProject'?
General FAQ
Ask a Question
Bugs and Suggestions
Article Help Forum
About Us
Search within:
Articles
Quick Answers
Messages
Comments by Gengou (Top 4 by date)
Gengou
29-Nov-14 11:07am
View
thank you
Gengou
8-Nov-13 19:45pm
View
thanks for help :P i'll try to figure it out
Gengou
8-Nov-13 17:43pm
View
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...
Gengou
8-Nov-13 16:23pm
View
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,