data matching problem

Hey, people!

i'm really tired so i hope i'll make sense in what i'm asking.

here is a diagram that hopefully helps...

i have two trees , the lines are branches and the dots within the circles are the items.

I want to know how i could prepare the data for a component that has two input hooks so that in the end i have a branch for each item of the left tree that contains the results of the items combination with all the items in the branches of the right tree, WHILE RETAINING the branch paths of the left tree (and preferably without having to duplicate a number of times the data in the branches of the right tree).

hope you guys get the idea, otherwise i'll try to make it more clear tomorrow...

thanks for taking an interest!

▶ Reply to This

Replies to This Discussion

Permalink Reply by Jon Mirtschin on October 30, 2011 at 10:07pm

That's interesting, I was discussing what I think is the same request with David yesterday, where I wanted the data matching to produce the blue. I did find a work around with data duplication.

I've attached my images, see if you make sense of them and agree it is the same request.

▶ Reply

Permalink Reply by Andrei Raducanu on October 31, 2011 at 3:55am

hey, thanks a lot for answering!

unfortunately i didn't quite figure out your case, but i don't think it matters much, since i am looking for a solution that doesn't involve duplicating the data a lot (i know that way around, and it does the job, but not in an elegant way)

i'm really curious if there is another way (preferably without the use of recursion) of doing this.

thanks a lot for taking an interest!

▶ Reply

Permalink Reply by Danny Boyes on October 31, 2011 at 5:54am

Here's the Pathmapper way:

▶ Reply

Permalink Reply by Andrei Raducanu on October 31, 2011 at 11:25am

thanks! but i want the initial branching to be parametric...

▶ Reply

Permalink Reply by Danny Boyes on October 31, 2011 at 2:12pm

Dynamic approach using Replace Branches.

Attachments:

TreeMerge.gh, 9 KB

▶ Reply

Permalink Reply by zlyx on October 31, 2011 at 3:45pm

incense

▶ Reply

Permalink Reply by Danny Boyes on October 31, 2011 at 5:19pm

Incense?

▶ Reply

Permalink Reply by zlyx on November 1, 2011 at 3:40pm

Praise...and Jealousy

▶ Reply

Permalink Reply by Danny Boyes on November 1, 2011 at 3:50pm

Permalink Reply by Andrei Raducanu on December 18, 2011 at 10:08am

hi and sorry for the veeeeeeeeeeeeeeeeeery late reply!

i just now fully understood your solution. it still duplicates the data, but it's maybe the shortest way to do it and it is definitely a new approach for me, so thanks a lot for your answer!