ancestors {SEMID} | R Documentation |
All ancestors of a collection of nodes
Description
Finds all the ancestors of a collection of nodes. These ancestors DO include the nodes themselves (every node is considered an ancestor of itself).
Usage
ancestors(this, nodes, ...)
## S3 method for class 'LatentDigraphFixedOrder'
ancestors(this, nodes, includeObserved = T, includeLatents = T, ...)
## S3 method for class 'LatentDigraph'
ancestors(this, nodes, includeObserved = T, includeLatents = T, ...)
## S3 method for class 'MixedGraph'
ancestors(this, nodes, ...)
Arguments
this |
the graph object |
nodes |
the nodes from which to find all ancestors |
... |
ignored. |
includeObserved |
if TRUE includes observed nodes in the returned set. |
includeLatents |
if TRUE includes latent nodes in the returned set. |
Value
the ancestors of the nodes in the observed part of the graph.
[Package SEMID version 0.4.1 Index]