I need to implement a tree in Julia with depth of l=3. Initially the root node has a vector of m=10000 random values (k=rand(m)).Then this vector is divided into k=10 partitions where each node child has a vector of n=1000 values. Finally the leafs are connected to a given child node. each partition (child node) has 10 leafs where each leaf has a vector
of g= 100 values. Since each child node has a vector of 1000
values.this latter is shared with its leafs 100 values for each leaf.
so the structure of the tree is as follows: level 0 root node : vector of 10000 values level 1 10 child node each one of 1000 values level 2 10 leafs for each child node of 100 values (that means we have in total we have 100 leafs ) Thank you for helps |
--
You received this message because you are subscribed to the Google Groups "julia-stats" group.
To unsubscribe from this group and stop receiving emails from it, send an email to julia-stats...@googlegroups.com.
For more options, visit https://groups.google.com/d/optout.