adjoinMin -- computes the poset with a new minimum element

Synopsis

Usage:
Q = adjoinMin P
Q = adjoinMin(P, a)
Inputs:
- P, an object of class Poset
- a, a thing, the new minimal element of P
Outputs:
- Q, an object of class Poset

Description

This method simply creates a new poset Q with the minimal element a. If a is unspecified, the element 0 or 1 less than the smallest integer vertex is used.

i1 : P = poset {{1,4},{2,4},{3,4}};

i2 : adjoinMin(P, 0)

o2 = Poset{cache => CacheTable{...2...}                                         }
           GroundSet => {1, 4, 2, 3, 0}
           RelationMatrix => | 1 1 0 0 0 |
                             | 0 1 0 0 0 |
                             | 0 1 1 0 0 |
                             | 0 1 0 1 0 |
                             | 1 1 1 1 1 |
           Relations => {{0, 1}, {0, 4}, {0, 2}, {0, 3}, {1, 4}, {2, 4}, {3, 4}}

o2 : Poset

Ways to use `adjoinMin` :

adjoinMin(Poset)
adjoinMin(Poset,Thing)

adjoinMin -- computes the poset with a new minimum element

Synopsis

Description

See also

Ways to use adjoinMin :

Ways to use `adjoinMin` :