open_hypergraphs.hypergraph

class open_hypergraphs.hypergraph.Hypergraph(s: open_hypergraphs.finite_function.IndexedCoproduct, t: open_hypergraphs.finite_function.IndexedCoproduct, w: open_hypergraphs.finite_function.FiniteFunction, x: open_hypergraphs.finite_function.FiniteFunction)

s: IndexedCoproduct

t: IndexedCoproduct

w: FiniteFunction

x: FiniteFunction

property W

property X

classmethod empty(w: FiniteFunction, x: FiniteFunction) → Hypergraph: Construct the empty hypergraph with no hypernodes or hyperedges

classmethod discrete(w: FiniteFunction, x: FiniteFunction) → Hypergraph: The discrete hypergraph, consisting of only hypernodes

is_discrete() → bool: Check if a hypergraph is discrete

coproduct(H: Hypergraph) → Hypergraph: A coproduct of hypergraphs is pointwise on the components

classmethod coproduct_list(Hs: List[Hypergraph]) → Self: Compute the n-fold coproduct of hypergraphs for n > 0

coequalize_vertices(q: FiniteFunction) → Hypergraph

permute(w: FiniteFunction, x: FiniteFunction) → Hypergraph: Permute the nodes and edges of a Hypergraph

class open_hypergraphs.hypergraph.HasHypergraph(*args, **kwargs)

abstract classmethod Hypergraph() → Type[Hypergraph]

classmethod IndexedCoproduct() → Type[IndexedCoproduct]

classmethod FiniteFunction() → Type[FiniteFunction]

class open_hypergraphs.hypergraph.HypergraphArrow(source: open_hypergraphs.hypergraph.Hypergraph, target: open_hypergraphs.hypergraph.Hypergraph, w: open_hypergraphs.finite_function.FiniteFunction, x: open_hypergraphs.finite_function.FiniteFunction)

source: Hypergraph

target: Hypergraph

w: FiniteFunction

x: FiniteFunction