Wolfram Language Paclet Repository
Community-contributed installable additions to the Wolfram Language
WolframInstitute`Hypergraph`
OrderedHypergraphToGraph  |
|
| | ||||
▪
The resulting graph's vertices are tagged v for each vertex v of hg, and i v for each vertex v of the i-th hyperedge; edges chain a hyperedge's vertices, in the order given, from one node to the next and the last one to the corresponding node.
{"Vertex",
}
{"Hyperedge",
,
}
"Hyperedge"
"Vertex"
▪
Because each hyperedge gets its own nodes, two identical hyperedges remain distinguishable in the graph, unlike in .
"Hyperedge"
▪
uses the vertex order exactly as stored in [hg], regardless of hg's ; it does not enumerate the symmetry group the way does.
▪
The graph is reduced with , so only the minimal chain of edges needed to encode each hyperedge's position order is kept.
▪
▪
▪
Examples
(6)
Basic Examples
(1)
Convert a hypergraph to its ordered graph encoding:
In[1]:=
hg=
[{{1,2,3},{3,4}}];
[hg]
 | Hypergraph |
 | OrderedHypergraphToGraph |
Out[1]=
Its vertices distinguish the hypergraph's own vertices from per-hyperedge markers, one per vertex of each hyperedge:
In[2]:=
VertexList
[hg]
 | OrderedHypergraphToGraph |
Out[2]=
{{Vertex,1},{Vertex,2},{Vertex,3},{Vertex,4},{Hyperedge,1,1},{Hyperedge,1,2},{Hyperedge,1,3},{Hyperedge,2,3},{Hyperedge,2,4}}
Scope
(3)
Properties & Relations
(2)
 |
|
""