next | previous | forward | backward | up | top | index | toc | directory | Macaulay 2 web site

HyperGraph -- a class for hypergraphs.

Description

This class represents hypergraph. A hypergraph is a tuple (V,E) of vertices V and edges E which are subsets of the vertices. In this package, all hypergraphs have the additional property that no edge is subset of any other edge. Hypergraphs of this form are often referred to as clutters.
i1 : R = QQ[w,x,y,z];
i2 : H = hyperGraph(R, {{w,x},{w,y,z},{x,y,z}});
i3 : vertices H

o3 = {w, x, y, z}

o3 : List
i4 : edges H

o4 = {{w, x}, {w, y, z}, {x, y, z}}

o4 : List
i5 : ring H

o5 = R

o5 : PolynomialRing
Hypergraphs are always associated with a polynomial ring whose variables are the vertices of the hypergraph.

See also

Types of HyperGraph :

Functions and methods returning an object of class HyperGraph :

Methods that use an object of class HyperGraph :

For the programmer

The object HyperGraph is a type, with ancestor classes HashTable < Thing.