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

- elimTree(ChordalNet)
- elimTree(ChordalGraph) -- see elimTree -- elimination tree of a chordal graph
- elimTree(List,HashTable,HashTable) (missing documentation)
- RingMap ElimTree -- see RingMap ChordalNet -- apply ring map to a chordal network

- chordalNet(HashTable,HashTable,ElimTree,Digraph) -- construct chordal network from a digraph
- displayGraph(ElimTree) -- see displayGraph(String,String,ElimTree) -- displays an elimination tree using Graphviz
- displayGraph(String,String,ElimTree) -- displays an elimination tree using Graphviz
- chordalGraph(ElimTree)
- net(ElimTree)
- leaves(ElimTree) -- leaves of an elimination tree
- treewidth(ElimTree) -- see treewidth -- treewidth of a graph
- writeDotFile(String,ElimTree) -- see writeDotFile(String,Function,ChordalNet) -- writes a chordal network to a dot file