Implementation of Union find Algorithm

Question

2.00/5 (1 vote)

See more:

I have a series of Key value pairs. Each Key has 2 values. Values of Keys ma coincide.
Initially i start with Key1, ValueKey1, ValueKey2 are stored in a set.(Maybe Array).

Now for each consecutive Keyi, i check if Valuei, Valuei+1 are in the set. If any one of them is in the set, then join the set.

Else if both KeyValues are present in a set, discard that key .

How can i implement this thing using C++, i have very less idea, so i would suggest if possible a code snippet or a hint would be really helpful.

Posted 5-Nov-11 12:40pm

newbie.cppcoder

Add a Solution

Comments

Sergey Alexandrovich Kryukov 5-Nov-11 20:51pm

Not clear. Where is the union operation? How so: "If any one of them is in the set, then join the set"? If something is already in the set, why joining it?
Look, use precise mathematical notation, not your vague words.
--SA

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

Sergey Alexandrovich Kryukov · Answer 1 · 2011-11-05T14:55:00

Solution 1

A hint? OK, I'll give a hint, but first, see my comment to the question and realize that your formulation of the problem is not clear.

Now, a hint: you simply need implementation of set-theory operation like union (disjunction). Simply implement it by definition of that operation.

Try it and show us your code if you face any problems; if you also explain where is your difficulty, we can probably help you.

—SA

Posted 5-Nov-11 14:55pm

Sergey Alexandrovich Kryukov

Comments

RaisKazi 6-Nov-11 2:48am

Agree. Hints are always better than ready made code-snippet. 5ed

Sergey Alexandrovich Kryukov 6-Nov-11 10:16am

Thank you, Rais.
Well, in this case more advanced suggestions and even code fragment could be useful, but OP needs to provide more detail.
--SA