So I've been building a program that uses Monte Carlo simulations to find properties of evolutionary graph theory. One of the key functions of this is to be able to generate uniformly-distributed r...

Currently I can enumerate rooted planar unlabeled binary trees using the following brute-force Prolog code. e --> u | b | t. u --> ['[op(u),['], e, [']]']. b --> ['[op(b),['], e, [','],...

I want to generate all the Motzkin Number and store in an array. The formula is given as follows: My current implementation is just way too slow: void generate_slow() { mm[0] = 1; mm[1] = 1; ...