Math.Combinat.Trees.Nary

N-ary trees.

Documentation

derivTrees :: [Int] -> [Tree ()]

Computes the set of equivalence classes of rooted trees (in the sense that the leaves of a node are unordered) with n = length ks leaves where the set of heights of the leaves matches the given set of numbers. The height is defined as the number of edges from the leaf to the root.

TODO: better name?

unique labels

addUniqueLabelsTree :: Tree a -> Tree (a, Int)

Adds unique labels to a Tree.

addUniqueLabelsForest :: Forest a -> Forest (a, Int)

Adds unique labels to a Forest

addUniqueLabelsTree_ :: Tree a -> Tree Int

addUniqueLabelsForest_ :: Forest a -> Forest Int

labelling by depth

labelDepthTree :: Tree a -> Tree (a, Int)

Attaches the depth to each node. The depth of the root is 0.

labelDepthForest :: Forest a -> Forest (a, Int)

labelDepthTree_ :: Tree a -> Tree Int

labelDepthForest_ :: Forest a -> Forest Int

labelling by number of children

labelNChildrenTree :: Tree a -> Tree (a, Int)

Attaches the number of children to each node.

labelNChildrenForest :: Forest a -> Forest (a, Int)

labelNChildrenTree_ :: Tree a -> Tree Int

labelNChildrenForest_ :: Forest a -> Forest Int