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

# size(ChordalNet) -- size of a chordal network

- Function: size
- Usage:
    `size N`
- Inputs:
  - N, an instance of the type ChordalNet,
- Outputs:
  - a list, with the number of nodes in each rank

## Description

    i1 : R = QQ[x_0..x_3, MonomialOrder=>Lex];

    i2 : I = ideal {x_0^3-x_0, x_0*x_2-x_2, x_1-x_2, x_2^2-x_2, x_2*x_3^2-x_3};

    o2 : Ideal of R

    i3 : N = chordalNet I;

    i4 : chordalTria N;

    i5 : size N

    o5 = {3, 2, 2, 2}

    o5 : List

    i6 : N

                             2
    o6 = ChordalNet{ x  => {x  - 1, x , x  - 1} }
                      0      0       0   0
                     x  => {x , x  - 1}
                      1      1   1
                     x  => {x , x  - 1}
                      2      2   2
                     x  => {x , x  - 1}
                      3      3   3

    o6 : ChordalNet

## See also

- ChordalNet -- a chordal network
- nodes -- list of nodes of a chordal network

## Ways to use this method:

- size(ChordalNet) -- size of a chordal network

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