open-hypergraphs 0.3.1

Data-Parallel Algorithms for Open Hypergraphs
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21

use super::traits::*;
use crate::array::*;
use crate::finite_function::*;

/// Categories with [hypergraph structure](https://ncatlab.org/nlab/show/hypergraph+category).
/// We call this `Spider` to avoid confusion with the [crate::strict::Hypergraph] struct.
pub trait Spider<K: ArrayKind>: Arrow {
    /// Given an `Arrow` with type `f : A → B`,
    /// construct its dagger `f† : B → A`
    /// by using Hypergraph structure to bend sources to targets and vice-versa.
    fn dagger(&self) -> Self;

    /// Construct a spider using a type `w`, and source `s` and target `t` interface maps.
    fn spider(s: FiniteFunction<K>, t: FiniteFunction<K>, w: Self::Object) -> Option<Self>;

    /// Construct a "half-spider": a spider whose `t` leg is identity.
    fn half_spider(s: FiniteFunction<K>, w: Self::Object) -> Option<Self> {
        let t = FiniteFunction::<K>::identity(s.target());
        Self::spider(s, t, w)
    }
}