o three parts:
branch 1:
{0;0} N = 3
{0;1} N = 3
branch 2:
{1;0} N = 5
{1;1} N = 5
branch 3:
{2;0} N = 30
{2;1} N = 30
parthmapper won't change the length of branch, explode tree won't give me two branches in one output
…
0;5} n8 I can easily retrieve a specific tree branch, then modify the data, lets say to each have 6 items in their list instead of 8. the end resut i want is:
{0;0} n6
{0;1} n8
{0;2} n8
{0;3} n8
{0;4} n8
{0;5} n6
But i cant seem to get the "replace branch" componet to work
In reality i have a tree that consists of 108 branches, so exploding the tree and entwining (which is my normal work around) is impractical
any help is appreciated!…
indexes later and the k value is just 5. The goal is to output all combinations of length 5 from the list of integers 0 to 19.
I placed the list in brackets in order to make it iterable (I don't really know what this means.) Somehow I need to get the combinations out of the itertools.combination output.…
would like to group the paths based on their item count (n) values resulting in a tree which should look something like this:
{0;0} (3)
{0;1} (2)
{0;2} (2)
{0;3} (1)
in other words, all paths with 2 items are under one path, all with 6 items in another, and so on.
I feel that the pathmapper should be able to do this very easily but cannot figure out what the expression should be... I have tried searching the forum but have not had much luck!
Any ideas? Thanks a ton!…
{8} become {1) etc
(see image attached)
I've played around with series components and feeding the data into a tree branch in stages (0-4 5-9 etc), however the amount of branches i need to merge (5 in this case) is a variable that plan on changing in the future so I want a more sophisticated solution than manually copying groups of series components and feeding them into separate tree branches.Thanks in advance for any help…