Struct biodivine_lib_param_bn::symbolic_async_graph::GraphVertices

pub struct GraphVertices {
    bdd: Bdd,
    state_variables: Vec<BddVariable>,
}

Symbolic representation of a vertex set.

Implementation contains all symbolic variables, but parameter variables are unconstrained.

Fields

bdd: Bdd

state_variables: Vec<BddVariable>

Implementations

impl GraphVertices

pub fn new(bdd: Bdd, context: &SymbolicContext) -> Self

Create a new set of vertices using the given Bdd and a symbolic context.

pub fn copy(&self, bdd: Bdd) -> Self

Copy the context of this vertex set, but using a new bdd.

pub fn into_bdd(self) -> Bdd

Convert this vertex set into a raw Bdd.

pub fn as_bdd(&self) -> &Bdd

View this vertex set as a raw Bdd.

pub fn approx_cardinality(&self) -> f64

Approximate size of this set (error grows for large sets).

pub fn exact_cardinality(&self) -> BigInt

Compute exact BigInt cardinality of this set.

pub fn pick_singleton(&self) -> GraphVertices

Pick one vertex from this set and return it as a singleton.

If the set is empty, return empty set.

pub fn materialize(&self) -> IterableVertices

Create an iterable view of this vertex set.

Note that sadly you have to use set.materialize().iter() to actually iterate over the vertices, since we are not moving our the value of this set.

pub fn symbolic_size(&self) -> usize

Amount of storage used for this symbolic set.

pub fn to_dot_string(&self, context: &SymbolicContext) -> String

Convert this set to a .dot graph.

Trait Implementations

impl Clone for GraphVertices

fn clone(&self) -> GraphVertices

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for GraphVertices

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

Formats the value using the given formatter.

impl Hash for GraphVertices

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given Hasher.

impl PartialEq<GraphVertices> for GraphVertices

fn eq(&self, other: &GraphVertices) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &GraphVertices) -> bool

This method tests for !=.

impl Set for GraphVertices

fn union(&self, other: &Self) -> Self

fn intersect(&self, other: &Self) -> Self

fn minus(&self, other: &Self) -> Self

fn is_empty(&self) -> bool

fn is_subset(&self, other: &Self) -> bool

impl Eq for GraphVertices

impl StructuralEq for GraphVertices

impl StructuralPartialEq for GraphVertices