hypergraph#
The free hypergraph category with cospans of labeled hypergraphs as arrows.
Summary#
The labels of spiders can be of any type. |
|
Wires are n-tuples of |
|
A boundary is a pair of input and output |
|
The wiring of a hypergraph is given by a triple |
|
Mapping from |
|
A hypergraph is given by: |
Functions
Computes the pushout of two finite mappings using connected components. |