Macaulay2 » Documentation
Packages » Chordal :: ElimTree
next | previous | forward | backward | up | index | toc

ElimTree -- the elimination tree of a chordal graph

Description

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).

Functions and methods returning an object of class ElimTree :

Methods that use an object of class ElimTree :

For the programmer

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