By just looking up on google: http://mathematica.stackexchange.com/questions/11632/how-to-generate-a-random-tree
Anyway, if you do go on with your code, would you feel like sharing it? We could merge into SymPy a random expression generator, it can always be useful. Easiest way, recursive function picking a random element each time. If it's an atom, stop, otherwise call the function recursively on the children elements. You could easily store your node elements in a dictionary, telling you how many children there are. -- You received this message because you are subscribed to the Google Groups "sympy" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at https://groups.google.com/group/sympy. To view this discussion on the web visit https://groups.google.com/d/msgid/sympy/b1d980ba-9e9d-45ad-81c1-e5c0913f5afe%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
