e
7. True
8. True <-- this one
9. True
10. False
11. True
12. False
13. True
14. True <-- this one
15. True
16. False
17. True
18. False
19. True
20. True <-- this one
21. True
22. False
23. True
24. False
25. True
26. True <-- this one
27. True
28. False
29. True
30. False
31. True
32. True <-- this one
33. True
Any idea how I can solve this?
Thanks!…
1:
{0} N=5
{1} N=6
and a tree 2:
{0;0} N=1
{0;1} N=1
...
{0;18} N=1
{1;0} N=1
{1;1} N=1
...
{1;19} N=1
I want to basically modify Tree 1 in order to get
{0;0} N=5
{0;1} N=5
...
{0;18} N=5
{1;0} N=6
{1;1} N=6
...
{1;19} N=6
which is the Tree 1 with the structure of Tree 2 and the items of Tree 1 {0} branch populated at each {0;*} branch of Tree 2 and the items of Tree 1 {1} branch populated at each {1;*} branch of Tree 2.
…
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 …