Struct Hypergraph

pub struct Hypergraph<K: ArrayKind, O, A> {
    pub s: IndexedCoproduct<K, FiniteFunction<K>>,
    pub t: IndexedCoproduct<K, FiniteFunction<K>>,
    pub w: SemifiniteFunction<K, O>,
    pub x: SemifiniteFunction<K, A>,
}

Fields

s: IndexedCoproduct<K, FiniteFunction<K>>

t: IndexedCoproduct<K, FiniteFunction<K>>

w: SemifiniteFunction<K, O>

x: SemifiniteFunction<K, A>

Implementations

impl<K: ArrayKind, O, A> Hypergraph<K, O, A>

where K::Type<K::I>: AsRef<K::Index> + NaturalArray<K>, K::Type<O>: Array<K, O>, K::Type<A>: Array<K, A>,

pub fn new( s: IndexedCoproduct<K, FiniteFunction<K>>, t: IndexedCoproduct<K, FiniteFunction<K>>, w: SemifiniteFunction<K, O>, x: SemifiniteFunction<K, A>, ) -> Result<Hypergraph<K, O, A>, InvalidHypergraph<K>>

Safely create a Hypergraph, ensuring its data is valid.

pub fn validate(self) -> Result<Self, InvalidHypergraph<K>>

A hypergraph is valid when for both sources and targets segmented arrays:

1. Number of segments is equal to number of operations (x.len())
2. Values of segmented array are indices in set w.source()

pub fn empty() -> Hypergraph<K, O, A>

Construct the empty hypergraph with no nodes and no hyperedges.

pub fn discrete(w: SemifiniteFunction<K, O>) -> Hypergraph<K, O, A>

The discrete hypergraph, consisting of hypernodes labeled in O.

pub fn is_discrete(&self) -> bool

pub fn coequalize_vertices( &self, q: &FiniteFunction<K>, ) -> Option<Hypergraph<K, O, A>>

pub fn coproduct(&self, other: &Self) -> Self

pub fn tensor_operations(_: Operations<K, O, A>) -> Hypergraph<K, O, A>

Trait Implementations

impl<K: ArrayKind, O, A> Add<&Hypergraph<K, O, A>> for &Hypergraph<K, O, A>

where K::Type<K::I>: NaturalArray<K>, K::Type<O>: Array<K, O>, K::Type<A>: Array<K, A>,

type Output = Hypergraph<K, O, A>

The resulting type after applying the + operator.

fn add(self, rhs: &Hypergraph<K, O, A>) -> Self::Output

Performs the + operation.

impl<K: ArrayKind, O, A> Clone for Hypergraph<K, O, A>

where K::Type<K::I>: Clone, K::Type<O>: Clone, K::Type<A>: Clone,

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<K: ArrayKind, O: Debug, A: Debug> Debug for Hypergraph<K, O, A>

where K::Index: Debug, K::Type<K::I>: Debug, K::Type<O>: Debug, K::Type<A>: Debug,

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

Formats the value using the given formatter.