Wolfram Language Paclet Repository
Community-contributed installable additions to the Wolfram Language
WolframInstitute`Hypergraph`
EnumerateOrderedHypergraphs  |
|
| | ||||
|
| | ||||
|
| | ||||
▪
returns a list of objects whose hyperedges are ordered, so two hyperedges connecting the same vertices in different orders are distinct.
▪
The signature specifies hyperedges of arity , hyperedges of arity , etc, where the arity of a hyperedge is the number of vertices it connects.
{{m1,a1},{m2,a2},...}
m1
a1
m2
a2
▪
By default, returns one representative per isomorphism class, keeping only simple, connected hypergraphs.
▪
With no explicit vertex count, hypergraphs with up to the maximum number of vertices that a connected hypergraph of the given signature can have are enumerated.
▪
All
Automatic
▪
▪
Options of , such as or , are applied to every generated hypergraph.
"EdgeSymmetry"
▪
The following options can be given:
option | default | effect | |
"Simple" | keep only simple hypergraphs ( True False All | ||
"Connected" | keep only connected hypergraphs ( True False All | ||
"Canonical" | whether to keep a single representative per isomorphism class; None False Method |
Examples
(13)
Basic Examples
(2)
Enumerate all simple connected hypergraphs with two ordered binary hyperedges:
In[1]:=
 | EnumerateOrderedHypergraphs |
Out[1]=
,
,
,
_________________________________________________________________________________________________________________
Enumerate hypergraphs with three ordered binary hyperedges:
In[1]:=
| EnumerateOrderedHypergraphs |
Out[1]=
,
,
,
,
,
,
,
,
,
,
,
Scope
(3)
Options
(5)
Properties & Relations
(2)
Possible Issues
(1)
 |
|
""