now I want to combine some branches together ,the rule is : For path{2} contain number 2 and 5, then conbine the two paths together ,and for path{5} includes only 2&5,no other number ,so it's end .For path{3}, includes number 3&6 ,so we go to path{6}, path{6} includes 3&6&18, then wo go to path{18} , path{18} contains a new number 27, so we check path{27} ,path{27} includes only 27&18, no new numbers ,so it is end.
With this logic, path{2}&{5} become one tree finally , the contains is 2&5 ,and so path{3}&{6} &{18} &{27}(the contents is 3,6,18,27), and so others .
so what I want is:
{2}(2,5)+{5}(2,5)={2/5/anything}(2,5) ## the new path index doesnot matter{3}(3,6)+{6}(3,6,18)+{18}(18,27)+{27}(27,18)={3/6/18/27/?}(3,6,18,27) ``````etc
I tried path mapper, but I donot think it can do the trick this time. may be I just miss something very visible?? Awaiting for your kind help~Thanks in advance.…
0, 5, 10, 15, 20
1, 6, 11, 16, 21
2, 7, 12, 17, 22
3, 8, 13, 18, 23
4, 9, 14, 19, 24
and if i'm here is because i'm not able... :)
can you help me?
thank you
…
ents will do or which components will be available.
My problem arises because I want to obtain a list such as the following:
{{6, 5, 4, 3, 2, 1, 2, 3, 4, 5, 6}, {5, 6, 5, 4, 3, 2, 1, 2, 3, 4, 5}, {4, 5, 6, 5, 4, 3, 2, 1, 2, 3, 4}, {3, 4, 5, 6, 5, 4, 3, 2, 1, 2, 3}, {2, 3, 4, 5, 6, 5, 4, 3, 2, 1, 2}, {1, 2, 3, 4, 5, 6, 5, 4, 3, 2, 1}}
Which displayed as a matrix is:
If it were possible to combine GH operations (series, shift list, replace string...) with matrices I think it would be quite powerful. A matrix to list component like those available on scientific calculators, would then translate the matrix to list.
For me, matrices come in handy when dealing with surface patterns.
…
Added by Jesus Galvez at 6:46am on November 26, 2012
ee 3)
{5}
0 15
{6}
0 16
And I want to place points at every possible combination of these coordinates, treating Tree 1 as X coordinates, Tree 2 as Y coordinates, and Tree 3 as Z coordinates. Also, I would like the list of points to be a tree with paths corresponding to the coordinates. Wouldn't it be nice if I could plug these trees into a Point XYZ, with a new "branch cross reference" method, and get the following result?
{0:3:5}
0 {10.0, 13.0, 15.0}
{0:3:6}
0 {10.0, 13.0, 16.0}
{0:4:5}
0 {10.0, 14.0, 15.0}
{0:4:6}
0 {10.0, 14.0, 16.0}
{1:3:5}
0 {11.0, 13.0, 15.0}
{1:3:6}
0 {11.0, 13.0, 16.0}
{1:4:5}
0 {11.0, 14.0, 15.0}
{1:4:6}
0 {11.0, 14.0, 16.0}
{2:3:5}
0 {12.0, 13.0, 15.0}
{2:3:6}
0 {12.0, 13.0, 16.0}
{2:4:5}
0 {12.0, 14.0, 15.0}
{2:4:6}
0 {12.0, 14.0, 16.0}
In this form of cross referencing, every combination of individual branches from the different lists is used as separate input, and the output for each combination is put onto a branch in the result whose path is the concatenation of the input branch paths used.…
Added by Andy Edwards at 7:03pm on November 3, 2009
etc.
Group 2 - 1, 6, 11, 16, 21 etc.
Group 3 - 2, 7, 12, 17, 22 etc.
Group 4 - 3, 8, 13, 18, 23 etc.
Group 5 - 4, 9, 14, 19, 24 etc. "
except in data, the branches start at 0, so 'group 1' is branch 0
as for the order of your points, that depends on the input prior sorting...
yrs …