This type represents the elimination tree of a chordal graph.
The arcs of a chordal graph can be directed according to a perfect elimination ordering. The elimination tree of the graph is the transitive closure of such directed acyclic graph.
The constructor of this type is elimTree. An elimination tree can be visualized with displayGraph(ElimTree).
The object ElimTree is a type, with ancestor classes HashTable < Thing.