Struct graph_algo_ptas::algorithm::dynamic_programming::solve::DpTableEntry

pub struct DpTableEntry {
    pub val: i32,
    pub children: HashSet<(usize, BitVec)>,
    pub vertex_used: Option<usize>,
}

Represents a single entry in a dynamic programming table.

Contains the value of the entry and additional information needed for retrieving the actual solution at the end of the algorithm.

Fields

val: i32

Value of the table entry. Its meaning depends on the problem to be solved.

children: HashSet<(usize, BitVec)>

References to table entries of child nodes.

vertex_used: Option<usize>

The vertex which is used for calculating the table entry.

Implementations

impl DpTableEntry

pub fn new_leaf(val: i32, vertex_used: Option<usize>) -> Self

Create a table entry for a Leaf node.

pub fn new_forget(val: i32, child_id: usize, child_subset: BitVec) -> Self

Create a table entry for a Forget node.

pub fn new_intro(
    val: i32,
    child_id: usize,
    child_subset: BitVec,
    vertex_used: Option<usize>
) -> Self

Create a table entry for an Introduce node.

pub fn new_join(val: i32, left_id: usize, right_id: usize, subset: BitVec) -> Self

Create a table entry for a Join node.

Trait Implementations

impl Clone for DpTableEntry

fn clone(&self) -> DpTableEntry

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for DpTableEntry

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

Formats the value using the given formatter.