Macaulay2 » Documentation
Packages » Chordal :: digraph(ChordalNet)
next | previous | forward | backward | up | index | toc

# digraph(ChordalNet) -- digraph associated to a chordal network

- Function: digraph
- Usage:
    `digraph N`
- Inputs:
  - N, an instance of the type ChordalNet,
- Optional inputs:
  - EntryMode (missing documentation) => ..., default value "auto",
  - Singletons (missing documentation) => ..., default value null,
- Outputs:
  - a digraph,

## Description

Returns the digraph associated to a chordal network. The vertices of this digraph are given by the labels of the nodes.

    i1 : R = QQ[a,b,c,d,MonomialOrder=>Lex];

    i2 : I = ideal {a*b, a*c, b*c, c*d};

    o2 : Ideal of R

    i3 : N = chordalNet I;

    i4 : chordalTria N;

    i5 : reduceNet N;

    i6 : N

    o6 = ChordalNet{ a => {a,  }    }
                     b => {b,  , b}
                     c => {c,  }
                     d => { , d}

    o6 : ChordalNet

    i7 : nodes N / (Ni -> label Ni)

    o7 = {a_0, a_1, b_0, b_1, b_2, c_0, c_1, d_0, d_1}

    o7 : List

    i8 : digraph N

    o8 = Digraph{a_0 => {b_0, b_1}}
                 a_1 => {b_2}
                 b_0 => {c_1}
                 b_1 => {c_0}
                 b_2 => {c_0}
                 c_0 => {d_0}
                 c_1 => {d_1}
                 d_0 => {}
                 d_1 => {}

    o8 : Digraph

## See also

- displayNet -- displays a chordal network using Graphivz
- chordalNet(HashTable,HashTable,ElimTree,Digraph) -- construct chordal network from a digraph
- digraph -- Constructs a digraph

## Ways to use this method:

- digraph(ChordalNet) -- digraph associated to a chordal network

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