Struct OpenHypergraph

pub struct OpenHypergraph<O, A> {
    pub sources: Vec<NodeId>,
    pub targets: Vec<NodeId>,
    pub hypergraph: Hypergraph<O, A>,
}

A lax OpenHypergraph is a cospan of lax hypergraphs: a hypergraph equipped with two finite maps representing the interfaces.

Fields

sources: Vec<NodeId>

targets: Vec<NodeId>

hypergraph: Hypergraph<O, A>

Implementations

impl<O, A> OpenHypergraph<O, A>

pub fn tensor_assign(&mut self, rhs: OpenHypergraph<O, A>)

Compute the tensor product f.tensor(g) by mutating the data of f

impl<O, A> OpenHypergraph<O, A>

pub fn empty() -> Self

The empty OpenHypergraph with no nodes and no edges.

In categorical terms, this is the identity map at the unit object.

pub fn from_strict(f: OpenHypergraph<VecKind, O, A>) -> Self

pub fn new_node(&mut self, w: O) -> NodeId

Create a new node in the hypergraph labeled w.

pub fn new_edge(&mut self, x: A, interface: Hyperedge) -> EdgeId

pub fn new_operation( &mut self, x: A, source_type: Vec<O>, target_type: Vec<O>, ) -> (EdgeId, Interface)

Create a new “operation” in the hypergraph. Concretely, f.new_operation(x, s, t) mutates f by adding:

1. a new hyperedge labeled x
2. len(s) new nodes, with the ith node labeled s[i]
3. len(t) new nodes, with the ith node labeled t[i]

Returns the new hyperedge ID and the NodeIds of the source/target nodes.

This is a convenience wrapper for Hypergraph::new_operation

pub fn singleton(x: A, source_type: Vec<O>, target_type: Vec<O>) -> Self

An OpenHypergraph consisting of a single operation.

pub fn unify(&mut self, v: NodeId, w: NodeId)

Compute an open hypergraph by calling to_hypergraph on the internal Hypergraph.

pub fn add_edge_source(&mut self, edge_id: EdgeId, w: O) -> NodeId

pub fn add_edge_target(&mut self, edge_id: EdgeId, w: O) -> NodeId

impl<O: Clone + PartialEq, A: Clone> OpenHypergraph<O, A>

pub fn quotient(&mut self)

Apply the quotient map to identify nodes in the internal Hypergraph. This deletes the internal quotient map, resulting in a strict OpenHypergraph.

pub fn to_open_hypergraph(self) -> OpenHypergraph<VecKind, O, A>

Convert this lax OpenHypergraph to a strict crate::strict::OpenHypergraph by quotienting.

Trait Implementations

impl<O: Clone + PartialEq, A: Clone> Arrow for OpenHypergraph<O, A>

type Object = Vec<O>

fn source(&self) -> Self::Object

fn target(&self) -> Self::Object

fn identity(a: Self::Object) -> Self

the identity morphism on a

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

Compose morphisms in diagrammatic order: self ; other

impl<O: Clone + PartialEq, A: Clone> BitOr<&OpenHypergraph<O, A>> for &OpenHypergraph<O, A>

type Output = OpenHypergraph<O, A>

The resulting type after applying the | operator.

fn bitor(self, rhs: &OpenHypergraph<O, A>) -> Self::Output

Performs the | operation.

impl<O: Clone, A: Clone> Clone for OpenHypergraph<O, A>

fn clone(&self) -> OpenHypergraph<O, A>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<O: Debug, A: Debug> Debug for OpenHypergraph<O, A>

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

Formats the value using the given formatter.

impl<O: Clone + PartialEq, A: Clone> Monoidal for OpenHypergraph<O, A>

fn unit() -> Self::Object

the monoidal unit object

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

f \otimes g of two morphisms

impl<O: Clone + PartialEq, A: Clone> Shr<&OpenHypergraph<O, A>> for &OpenHypergraph<O, A>

type Output = Option<OpenHypergraph<O, A>>

The resulting type after applying the >> operator.

fn shr(self, rhs: &OpenHypergraph<O, A>) -> Self::Output

Performs the >> operation.

impl<O: Clone + PartialEq, A: Clone + PartialEq> Spider<VecKind> for OpenHypergraph<O, A>

fn dagger(&self) -> Self

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 spider( s: FiniteFunction<VecKind>, t: FiniteFunction<VecKind>, w: Self::Object, ) -> Option<Self>

Construct a spider using a type w, and source s and target t interface maps.

fn half_spider(s: FiniteFunction<K>, w: Self::Object) -> Option<Self>

Construct a “half-spider”: a spider whose t leg is identity.

impl<O: Clone + PartialEq, A: Clone + PartialEq> SymmetricMonoidal for OpenHypergraph<O, A>

fn twist(a: Self::Object, b: Self::Object) -> Self

Construct the symmetry \sigma_{a,b} from a and b.