Wolfram Language Paclet Repository
Community-contributed installable additions to the Wolfram Language
WolframInstitute`Hypergraph`
HypergraphToGraph  |
|
| | ||||
▪
For each hyperedge, enumerates its full edge symmetry group (see ), permutes the hyperedge's vertex list by every group element, and adds a between each pair of vertices adjacent in the permuted list.
▪
A hyperedge with symmetry (for instance a hyperedge given as a ) contributes edges only for its vertices exactly as listed; the default symmetry contributes an edge for every ordered pair of vertices in the hyperedge.
"Ordered"
"Unordered"
▪
Since a hyperedge can contribute the same directed edge more than once (through different symmetry-group elements), the resulting can carry multi-edges.
▪
Hyperedges of arity 1 contribute no edges; vertices not covered by a hyperedge remain isolated in the graph.
▪
▪
Examples
(8)
Basic Examples
(2)
Convert a hypergraph of ordinary directed edges to a graph:
In[1]:=
hg=
[{DirectedEdge[1,2],DirectedEdge[2,3],DirectedEdge[3,1]}];
[hg]
 | Hypergraph |
 | HypergraphToGraph |
Out[1]=
_________________________________________________________________________________________________________________
By default hyperedges are , so a pair contributes both directions:
"Unordered"
In[1]:=
EdgeList
[{{1,2}}]
 | HypergraphToGraph |
| Hypergraph |
Out[1]=
{12,21}
Scope
(3)
Properties & Relations
(2)
Possible Issues
(1)
 |
|
 |
|
""