Struct BoundedSearchTree 

pub struct BoundedSearchTree {
    pub max_depth: usize,
    pub branching_vector: Vec<usize>,
}

A bounded search tree algorithm with maximum depth and branching vector.

Fields

max_depth: usize

Maximum recursion depth (equals the parameter k).

branching_vector: Vec<usize>

Branching factor at each level.

Implementations

impl BoundedSearchTree

pub fn run(&self) -> bool

Simulates the bounded search tree and returns true if the search terminates. Returns true when max_depth > 0 (non-trivial search).

pub fn running_time_analysis(&self) -> String

Estimates the running time based on the branching vector. Uses the characteristic polynomial root as the base.

Trait Implementations

impl Clone for BoundedSearchTree

fn clone(&self) -> BoundedSearchTree

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for BoundedSearchTree

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

Formats the value using the given formatter.