Hi, I am trying to write an algorithm where i have a data tree with 2112 points in 672 branches from {0;0} to {13;47} .For all these primary 0 to 14 branches i have to check if the list in secondary branches in same as the first secondary branch(like{1,1},{2,1},{3,1}) , and return true or false for all 48 branches.
How can i do this using ghpython, as it needs to create nested lists
Nested List01.gh (13.6 KB)
just for understanding, for instance we take all sub-branches progressively from each main branch and compare if all of those sub-branches have identical elements?
if we for instance take sub-branch 0 it would look like the following image:
because branch {0;0} has 1 element and branch {13;0} has 4, those are for sure non identical lists, so it’s already enough to just set the result of this match as a False?
@inno
I need to take sub branch{0;0} 1compare it to {0,1} to {0;47}
and then {1;0} will compare to {1;1} to {1;47}
and similarly {13;0} will compare to {13;1} to {13;47}
As observation when comparing these branches will have same number of items.then i need to make a cull pattern if these subranches list are same as the first subbranch
this, for each sub-branch starting from {x;1}, should return True if the content is identical to {x;0}, else False
because you have 48 sub branches per branch, it returns 47 values per branch
Thank you , I didnt know tree helpers can have a null input
