Recursively find all possible path graphs originated from a given root in DAG.
path.find(index, map)
Index of a root node (a node whose index never appears in
map[, 2]
).
Matrix of n.edges
-by-2
dimension, where n.edges
is the number of directed edges in DAG. The first column has indices of
nodes that edges directing from, whereas the second column gives the indices
of nodes the corresponding edges directing towards.
Returns a list of path graphs originated from root index
, for
which the i
th element of the returned list is a vector of indices of
nodes in the i
th path graph.