Struct WeakKonigTree 

pub struct WeakKonigTree {
    pub max_depth: u32,
    pub nodes: Vec<u64>,
    pub depths: Vec<u32>,
}

A finite approximation to an infinite binary tree (König / WKL₀). Nodes are stored as bit-strings of bounded length.

Fields

max_depth: u32

Maximum depth of stored nodes.

nodes: Vec<u64>

The set of nodes (as u64 bit-strings of length ≤ max_depth).

depths: Vec<u32>

The length of each node bit-string (parallel to nodes).

Implementations

impl WeakKonigTree

pub fn complete(d: u32) -> Self

Create a complete binary tree of depth d.

pub fn count_at_depth(&self, d: u32) -> usize

Return the number of nodes at depth d.

pub fn is_infinite(&self) -> bool

Return true if the tree is infinite (has nodes at every depth 0..=max_depth).

pub fn greedy_path(&self) -> Vec<u8>

Greedily extract an infinite path (always extend with bit 0 if possible, else 1). Returns the sequence of bits representing the path.

Trait Implementations

impl Clone for WeakKonigTree

fn clone(&self) -> WeakKonigTree

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for WeakKonigTree

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.