Struct biodivine_lib_param_bn::symbolic_async_graph::GraphVertices

pub struct GraphVertices { /* private fields */ }

Symbolic representation of a vertex set.

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

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.

pub fn is_subspace(&self) -> bool

Return true if the set can be described by a single conjunction of literals. That is, the set is a hypercube in the $\mathbb{B}^n$ space.

pub fn is_singleton(&self) -> bool

Return true if the set represents a single vertex.

pub fn restrict_network_variable( &self, variable: VariableId, value: bool ) -> Self

Compute a set where the value of the given variable is restricted.

Restriction operation takes only the elements where variable=value, but then makes the result independent on this variable by erasing it. This is useful when you are computing various operations on subspaces.

pub fn fix_network_variable(&self, variable: VariableId, value: bool) -> Self

Compute a subset of this set where the given network variable is always fixed to the given value.

pub fn raw_projection(&self, eliminate: &[BddVariable]) -> RawProjection

Perform a “raw projection” which eliminates the given symbolic variables from this set.

Technically, you can supply any BddVariable, but the underlying Bdd of this set should only depend on state variables.

pub fn state_projection(&self, variables: &[VariableId]) -> StateProjection

Create an iterable symbolic projection which only retains the specified network variables.

pub fn iter(&self) -> GraphVertexIterator

Create an iterator equivalent to GraphVertices::into_iter, but without destroying the original object.

pub fn to_singleton_spaces(&self, ctx: &SymbolicSpaceContext) -> NetworkSpaces

Represent this set of vertices as a set of singleton subspaces instead.

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, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl IntoIterator for GraphVertices

type Item = ArrayBitVector

The type of the elements being iterated over.

type IntoIter = GraphVertexIterator

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl PartialEq 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: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for GraphVertices

impl StructuralPartialEq for GraphVertices