Enum GraphFactorization 

#[non_exhaustive]
pub enum GraphFactorization {
    Auto,
    Off,
    Force,
}

Structural routing for positive-dimensional sparse persistence.

Every terminal edge belongs to one vertex-biconnected block. Every terminal clique with at least two vertices lies in one such block, and every positive-dimensional cycle splits over the blocks. The engine can therefore compute H0 once on the whole graph and compute H1 and above on the cyclic blocks independently.

The diagram is identical under every setting. The automatic rule uses factorization only when there are at least two cyclic blocks and the largest holds at most nine tenths of their edges. A graph with one dominant block stays on the existing reducer.

Variants (Non-exhaustive)

Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.

Auto

Use the frozen structural rule.

Off

Reduce the whole terminal graph.

Force

Split every terminal graph.

Trait Implementations

impl Clone for GraphFactorization

fn clone(&self) -> GraphFactorization

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for GraphFactorization

impl Debug for GraphFactorization

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

Formats the value using the given formatter.

impl Default for GraphFactorization

fn default() -> GraphFactorization

Returns the “default value” for a type.

impl Eq for GraphFactorization

impl PartialEq for GraphFactorization

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

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for GraphFactorization