hyperiax.tree package

Submodules

hyperiax.tree.builders module

hyperiax.tree.childrenlist module

hyperiax.tree.initializers module

hyperiax.tree.plot_utils module

hyperiax.tree.printer_utils module

hyperiax.tree.tree module

class hyperiax.tree.tree.FastBiTree(depth)

Bases: HypTree

Mostly for simulation purposes, creates a bifurcating tree without the topology, making instantiation fast

class hyperiax.tree.tree.HypTree(topology, precompute_child_gathers=False)

Bases: object

add_property(name, shape=(), dtype=None, initializer=None, key=None)

iter_topology_bfs() → Iterator[TopologyNode]: Iterate over all of the nodes in a breadth first manner

iter_topology_dfs() → Iterator[TopologyNode]: Iterate over all of the nodes in a depth-first manner.

iter_topology_leaves_bfs() → Iterator[TopologyNode]: Iterate over all of the leaves in the tree, in a breadth-first manner.

iter_topology_leaves_dfs() → Iterator[TopologyNode]: Iterate over all of the leaves in the tree, in a depth-first manner.

iter_topology_levels() → Iterator[List[TopologyNode]]: Iterate over each level in the tree

class hyperiax.tree.tree.TopologyNode(parent: 'TopologyNode' = None, children: 'List[TopologyNode]' = <factory>, _backref: 'HypTree' = None, name: 'str' = None)