L = getGoodLeaf(H)
A good leaf of a hypergraph H is an edge L whose intersections with all other edges form a totally ordered set. It follows that L must have a free vertex, i.e., a vertex contained in no other edges. In the graph setting, a good leaf is an edge containing a vertex of degree one. The notion of a good leaf was introduced by X. Zheng in her Ph.D. thesis (2004).



The object getGoodLeaf is a method function.