Struct SteinerTree

pub struct SteinerTree {
    pub graph: UnGraph<(), i32, u32>,
    pub mapping: HashMap<usize, NodeIndex>,
    pub inverse_mapping: HashMap<NodeIndex, usize>,
    pub terminals: Vec<usize>,
}

Fields

graph: UnGraph<(), i32, u32>

mapping: HashMap<usize, NodeIndex>

inverse_mapping: HashMap<NodeIndex, usize>

terminals: Vec<usize>

Implementations

impl SteinerTree

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn cnot_cost(&self) -> usize

pub fn contains(&self, node: usize) -> bool

pub fn is_leaf(&self, node: usize) -> bool

pub fn neighbors(&self, node: usize) -> Vec<usize>

pub fn nodes(&self) -> Vec<usize>

pub fn add_node(&mut self, node: usize)

pub fn add_edge(&mut self, n1: usize, n2: usize)

pub fn remove_node(&mut self, node: usize)

pub fn update_tree(&mut self, new_support: &[usize], qbits: &[usize; 2])

pub fn prune_non_terminal_leaves(&mut self)

Trait Implementations

impl Clone for SteinerTree

fn clone(&self) -> SteinerTree

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for SteinerTree

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

Formats the value using the given formatter.