Fast Generation of Big Random Binary Trees

Add code
Jan 13, 2020
William B. Langdon
Figure 1 for Fast Generation of Big Random Binary Trees
Figure 2 for Fast Generation of Big Random Binary Trees
Figure 3 for Fast Generation of Big Random Binary Trees

Share this with someone who'll enjoy it:

Twitter IconFacebook IconLinkedin IconWhatsapp IconMessenger Icon

random_tree() is a linear time and space C++ implementation able to create trees of up to a billion nodes for genetic programming and genetic improvement experiments. A 3.60GHz CPU can generate more than 18 million random nodes for GP program trees per second.

* C++ code: http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/gp-code/rand_tree.cc_r1.43  
View paper onarxiv icon

Share this with someone who'll enjoy it:

Twitter IconFacebook IconLinkedin IconWhatsapp IconMessenger Icon