next | previous | forward | backward | up | top | index | toc | Macaulay2 website
EdgeIdeals :: simplicialComplexToHyperGraph

simplicialComplexToHyperGraph -- makes a (hyper)graph from a simplicial complex

Synopsis

Description

This function makes a HyperGraph from a SimplicialComplex. The edges of the HyperGraph are given by the facets of the SimplicialComplex. This is the inverse of the function hyperGraphToSimplicialComplex.

i1 : S = QQ[a..f];
i2 : Delta = simplicialComplex {a*b*c,b*c*d,c*d*e,d*e*f}

o2 = | def cde bcd abc |

o2 : SimplicialComplex
i3 : H = simplicialComplexToHyperGraph Delta

o3 = HyperGraph{edges => {{a, b, c}, {b, c, d}, {c, d, e}, {d, e, f}}}
                ring => S
                vertices => {a, b, c, d, e, f}

o3 : HyperGraph

See also

Ways to use simplicialComplexToHyperGraph :

For the programmer

The object simplicialComplexToHyperGraph is a method function.