Struct biodivine_lib_param_bn::symbolic_async_graph::GraphColoredVertices

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

Symbolic representation of a coloured set of graph vertices, i.e. a subset of $V \times C$.

Fields

bdd: Bdd

state_variables: Vec<BddVariable>

parameter_variables: Vec<BddVariable>

Implementations

impl GraphColoredVertices

Basic utility operations.

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

Construct a new colored vertex set from a given bdd and symbolic context.

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

Construct a new colored vertex set by copying the context of the current set.

The contents of the set are completely replaced using the provided bdd, but the underlying SymbolicAsyncGraph remains the same.

pub fn into_bdd(self) -> Bdd

Convert this set to a raw Bdd.

pub fn as_bdd(&self) -> &Bdd

View this set as a raw Bdd.

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

Convert this set to a .dot graph.

pub fn symbolic_size(&self) -> usize

Amount of storage used for this symbolic set.

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.

impl GraphColoredVertices

Relation operations.

pub fn minus_colors(&self, colors: &GraphColors) -> Self

Remove every occurrence of a color form colors set.

pub fn intersect_colors(&self, colors: &GraphColors) -> Self

Only retain colours in the supplied colors set.

pub fn minus_vertices(&self, vertices: &GraphVertices) -> Self

Remove every occurrence of a vertex from vertices, regardless of color.

pub fn intersect_vertices(&self, vertices: &GraphVertices) -> Self

Retain only occurrences of vertices from vertices, regardless of color.

pub fn pick_vertex(&self) -> Self

For every color, pick exactly one vertex.

pub fn pick_color(&self) -> Self

For every vertex, pick exactly one color.

pub fn pick_singleton(&self) -> GraphColoredVertices

Pick one (vertex, color) pair from this set and return it as a singleton.

If the set is empty, return empty set.

pub fn colors(&self) -> GraphColors

Set of all colors which are in this set for at least one vertex.

pub fn vertices(&self) -> GraphVertices

Set of all vertices which are in this set for at least one colour.

Trait Implementations

impl Clone for GraphColoredVertices

fn clone(&self) -> GraphColoredVertices

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for GraphColoredVertices

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

Formats the value using the given formatter.

impl Hash for GraphColoredVertices

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<GraphColoredVertices> for GraphColoredVertices

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

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

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

This method tests for !=.

impl Set for GraphColoredVertices

Set operations.

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 GraphColoredVertices

impl StructuralEq for GraphColoredVertices

impl StructuralPartialEq for GraphColoredVertices