Struct InternalSubGraph 

pub struct InternalSubGraph {
    pub filter: SuBitGraph,
    pub loopcount: Option<usize>,
}

Represents a subgraph consisting entirely of “internal” edges.

An internal subgraph is defined such that if a half-edge is part of this subgraph, its opposite half-edge must also be part of the subgraph. This means it cannot contain any “dangling” or “external” half-edges that connect to parts of the graph outside of itself. It represents a self-contained portion of the graph’s edge topology.

To represent a subgraph that does have external connections (or “hairs”), use types like HedgeNode or [ContractedSubGraph].

Fields

filter: SuBitGraph

A bitmask representing the set of half-edges included in this internal subgraph. For every half-edge h included in this filter, its opposite inv(h) must also be included.

loopcount: Option<usize>

An optional field, often used to cache the cyclomatic number (number of independent cycles) within this subgraph once computed.

Implementations

impl InternalSubGraph

pub unsafe fn new_unchecked(filter: SuBitGraph) -> Self

Create a new subgraph from a filter.

Safety

The filter must be valid, i.e. it must always have paired hedges.

impl InternalSubGraph

pub fn add_edge<E, V, H, N: NodeStorageOps<NodeData = V>>( &mut self, hedge: Hedge, graph: &HedgeGraph<E, V, H, N>, )

pub fn remove_edge<E, V, H, N: NodeStorageOps<NodeData = V>>( &mut self, hedge: Hedge, graph: &HedgeGraph<E, V, H, N>, )

pub fn try_new<E, V, H, N: NodeStorageOps<NodeData = V>>( filter: SuBitGraph, graph: &HedgeGraph<E, V, H, N>, ) -> Option<Self>

pub fn cleaned_filter_optimist<E, V, H, N: NodeStorageOps<NodeData = V>>( filter: SuBitGraph, graph: &HedgeGraph<E, V, H, N>, ) -> Self

pub fn cleaned_filter_pessimist<E, V, H, N: NodeStorageOps<NodeData = V>>( filter: SuBitGraph, graph: &HedgeGraph<E, V, H, N>, ) -> Self

pub fn valid<E, V, H, N: NodeStorageOps<NodeData = V>>( &self, graph: &HedgeGraph<E, V, H, N>, ) -> bool

pub fn to_hairy_subgraph<E, V, H, N: NodeStorageOps<NodeData = V>>( &self, graph: &HedgeGraph<E, V, H, N>, ) -> HedgeNode

pub fn set_loopcount<E, V, H, N: NodeStorageOps<NodeData = V>>( &mut self, graph: &HedgeGraph<E, V, H, N>, )

pub fn cycle_basis<E, V, H, N: NodeStorageOps<NodeData = V>>( &self, graph: &HedgeGraph<E, V, H, N>, ) -> (Vec<Cycle>, SimpleTraversalTree)

Trait Implementations

impl Clone for InternalSubGraph

fn clone(&self) -> InternalSubGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for InternalSubGraph

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for InternalSubGraph

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for InternalSubGraph

impl Hash for InternalSubGraph

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 Inclusion<Hedge> for InternalSubGraph

fn includes(&self, hedge_id: &Hedge) -> bool

Checks if this subgraph fully includes/contains the other entity.

fn intersects(&self, other: &Hedge) -> bool

Checks if this subgraph has any common elements with the other entity.

impl Inclusion<HedgePair> for InternalSubGraph

fn includes(&self, other: &HedgePair) -> bool

Checks if this subgraph fully includes/contains the other entity.

fn intersects(&self, other: &HedgePair) -> bool

Checks if this subgraph has any common elements with the other entity.

impl Inclusion<InternalSubGraph> for InternalSubGraph

fn includes(&self, other: &InternalSubGraph) -> bool

Checks if this subgraph fully includes/contains the other entity.

fn intersects(&self, other: &InternalSubGraph) -> bool

Checks if this subgraph has any common elements with the other entity.

impl Inclusion<Range<Hedge>> for InternalSubGraph

fn includes(&self, other: &Range<Hedge>) -> bool

Checks if this subgraph fully includes/contains the other entity.

fn intersects(&self, other: &Range<Hedge>) -> bool

Checks if this subgraph has any common elements with the other entity.

impl Inclusion<RangeFrom<Hedge>> for InternalSubGraph

fn includes(&self, other: &RangeFrom<Hedge>) -> bool

Checks if this subgraph fully includes/contains the other entity.

fn intersects(&self, other: &RangeFrom<Hedge>) -> bool

Checks if this subgraph has any common elements with the other entity.

impl Inclusion<RangeInclusive<Hedge>> for InternalSubGraph

fn includes(&self, other: &RangeInclusive<Hedge>) -> bool

Checks if this subgraph fully includes/contains the other entity.

fn intersects(&self, other: &RangeInclusive<Hedge>) -> bool

Checks if this subgraph has any common elements with the other entity.

impl Inclusion<RangeTo<Hedge>> for InternalSubGraph

fn includes(&self, other: &RangeTo<Hedge>) -> bool

Checks if this subgraph fully includes/contains the other entity.

fn intersects(&self, other: &RangeTo<Hedge>) -> bool

Checks if this subgraph has any common elements with the other entity.

impl Inclusion<RangeToInclusive<Hedge>> for InternalSubGraph

fn includes(&self, other: &RangeToInclusive<Hedge>) -> bool

Checks if this subgraph fully includes/contains the other entity.

fn intersects(&self, other: &RangeToInclusive<Hedge>) -> bool

Checks if this subgraph has any common elements with the other entity.

impl Inclusion<SubSet<Hedge>> for InternalSubGraph

fn includes(&self, other: &SuBitGraph) -> bool

Checks if this subgraph fully includes/contains the other entity.

fn intersects(&self, other: &SuBitGraph) -> bool

Checks if this subgraph has any common elements with the other entity.

impl Index<Hedge> for InternalSubGraph

type Output = bool

The returned type after indexing.

fn index(&self, index: Hedge) -> &Self::Output

Performs the indexing (container[index]) operation.

impl PartialEq for InternalSubGraph

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

Tests for self and other values to be equal, and is used by ==.

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

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

impl PartialOrd for InternalSubGraph

fn partial_cmp(&self, other: &Self) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Serialize for InternalSubGraph

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl SubGraphLike for InternalSubGraph

fn nedges<E, V, H, N: NodeStorageOps<NodeData = V>>( &self, _graph: &HedgeGraph<E, V, H, N>, ) -> usize

Number of full edges included in the subgraph

fn covers<E, V, H, N: NodeStorageOps<NodeData = V>, S: SubSetOps<Hedge> + SubSetLike<Hedge>>( &self, graph: &HedgeGraph<E, V, H, N>, ) -> S

maximal graph that contains all nodes of the subgraph

fn background_color(&self, hedge_pair: Option<HedgePair>) -> Option<String>

fn dot_fmt<W: Write, E, V, H, N: NodeStorageOps<NodeData = V>, Str: AsRef<str>>( &self, writer: &mut W, graph: &HedgeGraph<E, V, H, N>, graph_info: Str, hedge_attr: &impl Fn(&H) -> Option<String>, edge_attr: &impl Fn(&E) -> Option<String>, node_attr: &impl Fn(&V) -> Option<String>, ) -> Result<(), Error>

fn dot_io<W: Write, E, V, H, N: NodeStorageOps<NodeData = V>, Str: AsRef<str>>( &self, writer: &mut W, graph: &HedgeGraph<E, V, H, N>, graph_info: Str, hedge_attr: &impl Fn(&H) -> Option<String>, edge_attr: &impl Fn(&E) -> Option<String>, node_attr: &impl Fn(&V) -> Option<String>, ) -> Result<(), Error>

fn hairs(&self, node: impl Iterator<Item = Hedge>) -> SuBitGraph

impl SubGraphOps for InternalSubGraph

fn complement<E, V, H, N: NodeStorageOps<NodeData = V>>( &self, graph: &HedgeGraph<E, V, H, N>, ) -> Self

impl SubSetLike for InternalSubGraph

type Base = SubSet<Hedge>

type BaseIter<'a> = SubSetIter<'a>

fn has_greater(&self, hedge: Hedge) -> bool

Contains an id with index >= hedge

fn size(&self) -> usize

Number of half-edges in the graph this is a subgraph of

fn join_mut(&mut self, other: Self)

Appends all incuded half-edges at the end of other

fn included_iter(&self) -> Self::BaseIter<'_>

fn n_included(&self) -> usize

Number of half-edges included in the subgraph

fn empty(size: usize) -> Self

fn included(&self) -> &SuBitGraph

Returns a simple Self::Base of all included hedges

fn string_label(&self) -> String

fn from_base62(label: &str, size: usize) -> Option<Self>

fn is_empty(&self) -> bool

fn has_lesser(&self, hedge: ID) -> bool

Contains an id with index < hedge

fn join(self, other: Self) -> Self

joins two subsets into one, (this is not union)

impl SubSetOps for InternalSubGraph

fn intersect_with(&mut self, other: &InternalSubGraph)

fn union_with_iter(&mut self, other: impl Iterator<Item = Hedge>)

fn union_with(&mut self, other: &InternalSubGraph)

fn sym_diff_with(&mut self, other: &InternalSubGraph)

fn empty_intersection(&self, other: &InternalSubGraph) -> bool

fn empty_union(&self, other: &InternalSubGraph) -> bool

fn subtract_with(&mut self, other: &Self)

fn all_pairwise_ops( left: &mut AHashSet<Self>, right: &[Self], op: &impl Fn(&Self, &Self) -> Self, ) -> bool

Applies a pairwise operation op between all elements of left (a mutable set) and all elements of right (a slice), adding results to left. Returns true if left was modified.

fn all_pairwise_ops_filter_map( left: &mut AHashSet<Self>, right: &[Self], op: &impl Fn(&Self, &Self) -> Self, filter_map: &impl Fn(Self) -> Option<Self>, ) -> bool

fn all_pairwise_unions(left: &mut AHashSet<Self>, right: &[Self]) -> bool

fn all_pairwise_sym_diff(left: &mut AHashSet<Self>, right: &[Self]) -> bool

fn all_ops_iterative_filter_map( set: &[Self], op: &impl Fn(&Self, &Self) -> Self, filter_map: &impl Fn(Self) -> Option<Self>, ) -> AHashSet<Self>

fn all_unions_iterative(set: &[Self]) -> AHashSet<Self>

fn all_sym_diff_iterative(set: &[Self]) -> AHashSet<Self>

fn all_op_powerset_filter_map( set: &[Self], op: impl Fn(&mut Self, &Self), filter_map: &impl Fn(Self) -> Option<Self>, ) -> Result<AHashSet<Self>, TryFromIntError>

fn all_unions_powerset_filter_map( set: &[Self], filter_map: &impl Fn(Self) -> Option<Self>, ) -> Result<AHashSet<Self>, TryFromIntError>

fn all_sym_diff_powerset( set: &[Self], filter_map: &impl Fn(Self) -> Option<Self>, ) -> Result<AHashSet<Self>, TryFromIntError>

fn n_op( n: usize, set: &[Self], op: &impl Fn(&Self, &Self) -> Self, ) -> AHashSet<Self>

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

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

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

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