getGoodLeafIndex -- returns the index of an edge that is a good leaf

Synopsis

• Usage:

  n = getGoodLeafIndex(H)

• Inputs:

  • H, a hypergraph
• Outputs:

  • n, an integer, the index of an edge in H of a good leaf. Returns -1 if H does not have a good leaf.

Description

i1 : R = QQ[a..g];

i2 : H = hyperGraph {b*c*d*e, a*b*c*d, c*d*f, d*g, e*f*g};

i3 : getGoodLeaf(H)

o3 = {a, b, c, d}

o3 : List

i4 : edges(H)

o4 = {{a, b, c, d}, {b, c, d, e}, {c, d, f}, {d, g}, {e, f, g}}

o4 : List

i5 : getGoodLeafIndex(H)

o5 = 0

See also

• getGoodLeaf -- returns an edge that is a good leaf
• hasGoodLeaf -- determines if a HyperGraph contains a good leaf
• isGoodLeaf -- determines if an edge is a good leaf