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

# elimTree -- elimination tree of a chordal graph

- Usage:
    `elimTree G`
- Inputs:
  - G, an instance of the type ChordalGraph,
- Outputs:
  - an instance of the type ElimTree, the elimination tree of G

## Description

This method computes the elimination tree of some given chordal graph.

    i1 : G = graph(toList(0..9),{
             {0,{6,7}},{1,{4,9}},{2,{3,5}},{3,{7,8}},
             {4,{5,8}},{5,{8}},{6,{8,9}},{7,{8}},{8,{9}} });

    i2 : Gc = chordalGraph G

    o2 = ChordalGraph{0 => {6, 7}    }
                      1 => {4, 9}
                      2 => {3, 5}
                      3 => {5, 7, 8}
                      4 => {5, 8, 9}
                      5 => {7, 8, 9}
                      6 => {7, 8, 9}
                      7 => {8, 9}
                      8 => {9}
                      9 => {}

    o2 : ChordalGraph

    i3 : elimTree Gc

    o3 = ElimTree{0 => 6   }
                  1 => 4
                  2 => 3
                  3 => 5
                  4 => 5
                  5 => 7
                  6 => 7
                  7 => 8
                  8 => 9
                  9 => null

    o3 : ElimTree

## Ways to use elimTree:

- `elimTree(ChordalNet)` -- see ElimTree -- the elimination tree of a chordal graph
- `elimTree(ChordalGraph)`
- elimTree(List,HashTable,HashTable) (missing documentation)

## For the programmer

The object elimTree is a method function.

The source of this document is in /build/macaulay2-88fgJW/macaulay2-1.25.11+ds/M2/Macaulay2/packages/Chordal/ChordalDoc.m2:430:0.