Macaulay2 » Documentation
Packages » PhylogeneticTrees :: labeledBinaryTrees
next | previous | forward | backward | up | index | toc

labeledBinaryTrees -- enumerate all binary labeled trees

Synopsis

Description

This function enumerates all possible binary trees with n leaves labeled by $0,\ldots, n-1$, including all possible labelings. The trees are represented as an object of class LeafTree.

i1 : L = labeledBinaryTrees 4

o1 = {{{0, 1, 2, 3}, {set {1, 3}, set {0}, set {1}, set {2}, set {3}}}, {{0,
     ------------------------------------------------------------------------
     1, 2, 3}, {set {1, 2}, set {0}, set {1}, set {2}, set {3}}}, {{0, 1, 2,
     ------------------------------------------------------------------------
     3}, {set {2, 3}, set {0}, set {1}, set {2}, set {3}}}}

o1 : List

See also

Ways to use labeledBinaryTrees :

For the programmer

The object labeledBinaryTrees is a method function.