Enum GraphProductType 

pub enum GraphProductType {
    Cartesian,
    Lexicographic,
    Strong,
    Tensor,
    Modular,
}

Selects which graph product type to compute.

Passed to graph_product to select the product type. See each variant’s documentation for the adjacency condition.

Variants

Cartesian

Cartesian product: (u1,v1) ~ (u2,v2) iff u1=u2, v1~v2 or u1~u2, v1=v2.

Lexicographic

Lexicographic product: (u1,v1) ~ (u2,v2) iff u1~u2 or (u1=u2 and v1~v2). Not commutative.

Strong

Strong product (normal product): union of Cartesian and tensor.

Tensor

Tensor (categorical/direct) product: (u1,v1) ~ (u2,v2) iff u1~u2 and v1~v2.

Modular

Modular product: (u1,v1) ~ (u2,v2) iff (u1~u2 and v1~v2) or (u1≁u2 and v1≁v2), where u1≠u2 and v1≠v2. Requires simple inputs.

Trait Implementations

impl Clone for GraphProductType

fn clone(&self) -> GraphProductType

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for GraphProductType

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

Formats the value using the given formatter.

impl PartialEq for GraphProductType

fn eq(&self, other: &GraphProductType) -> 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 Copy for GraphProductType

impl Eq for GraphProductType

impl StructuralPartialEq for GraphProductType