|
|
|
I seriously doubt anyone is going to run and debug your program for you. People normally get paid for stuff like that.
I will not be snarky.
I will not be snarky.
I will not be snarky.
The difficult we do right away...
...the impossible takes slightly longer.
modified 16-Nov-13 17:50pm.
|
|
|
|
|
|
Don't be abusive.
The difficult we do right away...
...the impossible takes slightly longer.
|
|
|
|
|
I'm not.. I don't understand your post if you don't try to help. I'm really not interested if someone is paid to run a program or not.. I had a question regarding a problem, you can help or not..
|
|
|
|
|
It's not a smartass answer. What exactly is it you're requesting? That someone debug the program for you?
The difficult we do right away...
...the impossible takes slightly longer.
|
|
|
|
|
Someone show me what can I change so my program won't connect more than 2 points, because I'm stuck for 4 days now
|
|
|
|
|
I'm sorry. Let me help you by saying that you need to ask a more specific question than simply, "Why doesn't my program work?"
The difficult we do right away...
...the impossible takes slightly longer.
|
|
|
|
|
It works sometimes  so that's not the right question.. But thanks for finally trying to discuss normally  I know why it doesn't work, but didn't find how to fix it, so I thought maybe someone here could help me a bit
|
|
|
|
|
Well, if you "know why it doesn't work" don't you think it would help us if you had actually shared that information?
The only instant messaging I do involves my middle finger.
English doesn't borrow from other languages.
English follows other languages down dark alleys, knocks them over and goes through their pockets for loose grammar.
|
|
|
|
|
if you compare with the hungarian algorithm the agents are my points, and my tasks are also the points. So for point i the best distance may be j, but for point j, it can be another point. That generates the triangles, or if you run the program with more points - other k-gons.
|
|
|
|
|
Well, Did anybody use Hungarian Algorithm till now? 
|
|
|
|
|
Well, I look at this code and say to myself "I don't see a VOID anywhere, so ...". But I'm interested in the things you say you'd like to accomplish. Mainly debug it so there's no redundancy in the output.
My job isn't so easy. But providing a .proj and making a CP plea out of it would certainly accomplish your goal of being insightful and adding content.
Thanks ahead of time.
|
|
|
|
|
Sorry, I didn't really understood your message..
I'm bad in English
|
|
|
|
|
Basically, what tools are you using?
By "VOID" I mean there's nothing here but Classes and the like. If this was a bonafide Visual Studio project I could open it up there, and debug it myself. At least confirm that it doesn't do what it's designed to do as-is.
I want to help. But consider how the average CPian goes about "helping" here.
|
|
|
|
|
It's visual studio 2012, C# Windows Form Application. You just have to create the method for Form1_Paint.
Thanks for your help
|
|
|
|
|
I'm certainly not going to try to run that, but I would think that you should have a set of unconnected points and a set of connected points. When you connect two unconnected points, you move them both to the connected points set.
|
|
|
|
|
i also tried in that way. But how are you going to make that? Because the algorithm works on the whole matrix, you can't call it for n times to generate n vectors...
|
|
|
|
|
No, I'm not going to "create a project" and run your code - I have better things to do with my life than run random code from random people, where I don't know what the actual code does, and am not about to wade through to find out if there's anything nasty buried in there.
Edit your question.
Cut the code down to just the relevant fragments, and explain what it is doing that you don't expect, or not doing that you do - with details on exactly how to cause it.
To be honest, I don't know why your previous post was closed, but if your attitude then was similar to you attitude this time, I'm not in the least surprised. Do try to remember that we are not paid for this - we do it to help people - so being rude, arrogant and unhelpful does not encourage people to spend their time on helping you.
Help us to help you!
The only instant messaging I do involves my middle finger.
English doesn't borrow from other languages.
English follows other languages down dark alleys, knocks them over and goes through their pockets for loose grammar.
|
|
|
|
|
Well you clearly copied this[^] and made a couple of changes. Try copying it without making changes.
|
|
|
|
|
only changes on algorithm is that the algorithm works for double values too, not only int
|
|
|
|
|
Oh ok, well then it should work, shouldn't it? Unless that code is broken and no one ever noticed, which is, of course, possible.
Are you sure you're expecting the right thing?
|
|
|
|
|
I have a C# object, something like:
class GUIItem
{
string Name;
string Value;
..
.. some random GUI properties
..
}
have another one that represents a database table:
class SomeDBObject
{
string Name;
string Value;
..
.. some random DB properties
..
}
So what happens is that the GUI builds up the GUIItem objects from an XML resource. However, it only has the Name property. It doesn't have the Value since that is stored in the DB. The concept is that the XML resource tells the GUI how to build the UI and the DB stores the values.
So to load the UI, I need to restore the Value properties from the DB.
So what I need to do is to match up the GUIItem and the SomeDBObject by the Name property and copy SomeDBObject.Value over to GUIItem.Value.
I know I can do this easily with a nested for loop O(n^2). But is there some cooler algorithm?
I think most of the time the KVPs in the database and the UI are going to be in the same order, so I can get by with an O(n)... but its possible a new item might be added to the GUI that is not yet configured in the DB and that would throw things off. Or if an item in the GUI was deleted or re-ordered for some reason.
Something in LINQ perhaps with some kind of join?
|
|
|
|
|
If you are certain that there is 1 DB entry per 1 GUIItem then you can build a HashTable[^] using the name as the key, then after you've initialized your GUIObjects and you are setting the values, the operation becomes an O(n), since element access in a hash table is O(n).
You'll still have to build the table, so really the operation becomes O(n) + O(n), once for building the table, and once when you are setting the GUIItems.
|
|
|
|
General 
News 
Suggestion 
Question 
Bug 
Answer 
Joke 
Praise 
Rant 
Admin 
Submit an article or tip
