Whether to create a directed tree. The edges of the tree are
oriented away from the root.
method
The algorithm to use to generate the tree. ‘prufer’
samples Prufer sequences uniformly and then converts the sampled sequence to
a tree. ‘lerw’ performs a loop-erased random walk on the complete
graph to uniformly sampleits spanning trees. (This is also known as Wilson's
algorithm). The default is ‘lerw’. Note that the method based on
Prufer sequences does not support directed trees at the moment.
Details
In other words, the function generates each possible labelled tree with the
given number of nodes with the same probability.