Split Trees into its biggest/first branches

Hi community,

I’m looking for an efficient way to split a tree into its biggest (or one may call them first) branches. In the example below I have a tree whose biggest branches would be {0;0;x} and {0;1;y} where the indices x and y can run independently of each other from 0 to any other positive integer.


The two trees I’m looking for after having split the big tree would be these two below:


Thank you,


Hi Juan

Hope this helps:

basically, just need to use the split tree component with a string to match what you are looking for, in your case it would be ‘{;1}’

i am not sure on all of the search patterns, i.e. you could look on the forums, but there should be other patterns you could use to say search for greater than etc.,


1 Like