next | previous | forward | backward | up | top | index | toc | Macaulay2 website
Graphs :: nondescendants

nondescendants -- returns the nondescendants of a vertex of a digraph

Synopsis

Description

The nondescendants of a directed graph are all the vertexSet u of D such that u is not reachable from v.

i1 : D = digraph({a,b,c,d,e},{{a,b},{b,c},{b,d},{e,b}});
i2 : nondescendants (D, d)

o2 = set {a, b, c, e}

o2 : Set

See also

Ways to use nondescendants :

For the programmer

The object nondescendants is a method function.