View source: R/LatentDigraph.R
ancestors | R Documentation |
Finds all the ancestors of a collection of nodes. These ancestors DO include the nodes themselves (every node is considered an ancestor of itself).
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, ...)
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. |
the ancestors of the nodes in the observed part of the graph.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.