Expand description
A Coffman-Graham-inspired layering algorithm.
Functions§
- converse
- Compute the converse of an
IndexedCoproduct
thought of as a “multirelation”. - converse_
iter - Given a FiniteFunction
X → L
, compute its converse, a relationr : L → X*
, and return the result as an array of arrays, wherer_i
is the list of elements inX
mapping to i. - indegree
- Compute indegree of all nodes in a multigraph.
- layer
- Compute a layering of an
OpenHypergraph
: a mappinglayer : X → K
from operations to integers compatible with the partial ordering onX
induced by hypergraph structure. - layered_
operations - Given an
OpenHypergraph
, compute a layering of its operations as a finite functionX → L
, then return this as an array-of-arraysr
. - operation_
adjacency - Return the adjacency map for an
OpenHypergraph
f
.