Finite plane trees as rooted compact metric probability spaces #
The carrier is the existing subtype PlaneTree.Vertex t of present addresses,
with its graph metric. Its Borel probability measure gives mass 1 / t.size
to every vertex, including the root and all leaves. No measurable structure on
the type of plane trees or on all addresses is introduced.
This module only bundles the finite tree. Metric scaling and comparison with a continuously coded tree are separate constructions.
Enumerate the existing vertex subtype using the DFS address list.
Equations
Cardinality counts all vertex occurrences, including the root.
The distinguished root address.
Instances For
Use the Borel structure of the existing graph metric.
Equations
Uniform probability on every vertex of the finite tree.
Equations
Instances For
The whole finite vertex space with its graph metric and uniform probability.
Equations
Instances For
The same measured vertex space, rooted at the empty address.