Wolfram Language Paclet Repository
Community-contributed installable additions to the Wolfram Language
WolframInstitute`Hypergraph`
HypergraphIncidence  |
|
| | ||||
▪
The keys of the result are the vertices of hg, in the order given by ; the value at each vertex is the list of hyperedges of hg containing it, in order.
▪
A vertex belonging to no hyperedge gets the empty list .
{}
▪
Examples
(5)
Basic Examples
(1)
Find, for each vertex, the hyperedges it belongs to:
In[1]:=
Normal@
[{{1,2},{2,3},{1,2,3}}]
 | HypergraphIncidence |
 | Hypergraph |
Out[1]=
{1{{1,2},{1,2,3}},2{{1,2},{2,3},{1,2,3}},3{{2,3},{1,2,3}}}
Scope
(2)
Properties & Relations
(1)
Possible Issues
(1)
 |
|
 |
|
""