next
|
previous
|
forward
|
backward
| up |
top
|
index
|
toc
|
Macaulay2 web site
Graphs
(missing documentation) ::
reachable
reachable -- Returns the vertices reachable in a digraph from a given collection of vertices
Synopsis
Usage:
Rl = reachable(D, L)
Rs = reachable(D, S)
Inputs:
D
,
an object of class
Digraph
(missing documentation)
L
,
a
list
, a list of vertices
S
,
a
set
, a set of vertices
Outputs:
Rl
,
a
list
, the list of reachable vertices
Rs
,
a
set
, the set of reachable vertices
Description
Given a collection of vertices of a digraph, the reachable vertices are those that are on a path away from a vertices in the collection.
See also
descendants
-- returns the descendants of a digraph
isReachable
-- checks if a vertex u is reachable from a vertex v
Ways to use
reachable
:
reachable(Digraph,List)
reachable(Digraph,Set)