ow do you sort data trees with distinctive number of list items in each branch?
In this example, there are 161 branches with three distinctive number of list items, 3, 4, and 5. I want to know if there is another way to sort out this data tree into this way: 3 vertices {0;0}, {0;1}, {0;2],...4 vertices {1;0}, {1;1}, {1;2},... 5 vertices {2;0}, {2;1}, {2;2},...
2. Is there a way to sort our surfaces based on number of distinctive list items automatically? For example, if there are surfaces with 3, 4, 5, 6, and 7 vertices, I want to make five branches with the same number of vertices automatically.
I hope my questions make sense...
Thank you!
Dongyeop …
Added by Dongyeop Lee at 12:14pm on October 3, 2016
one list by -1 while disabling index wrapping. Essentially, this removes the first item from one list and the last item from the other list. Conceptually, these are your lists:
Source List: [0, 1, 2, 3, 4, 5]
Shift List 1: [0, 1, 2, 3, 4]
Shift List 2: [1, 2, 3, 4, 5]
If you input these lists into a Line component, you will connect each respective list item with the other, essentially 0-1, 1-2, 2-3, etc.
…