Wolfram Language Paclet Repository
Community-contributed installable additions to the Wolfram Language
WolframInstitute`Hypergraph`
ConnectedHypergraphQ  |
|
| | ||||
▪
replaces each hyperedge with a path linking consecutive vertices (a hyperedge of arity k contributes ordinary edges), builds a on the same vertices, and tests it with .
𝑘-1
▪
A single vertex, whether isolated or from an arity-1 hyperedge, is trivially connected.
▪
An empty hyperedge contributes no edges, so it neither connects nor disconnects the hypergraph.
Examples
(5)
Basic Examples
(2)
A hypergraph whose hyperedges share vertices is connected:
In[1]:=
 | ConnectedHypergraphQ |
 | Hypergraph |
Out[1]=
True
_________________________________________________________________________________________________________________
A hypergraph split into two disjoint hyperedges is not connected:
In[1]:=
| ConnectedHypergraphQ |
| Hypergraph |
Out[1]=
False
Scope
(2)
Properties & Relations
(1)
 |
|
 |
|
""