latentDigraphHasSimpleNumbering: Checks that a LatentDigraph has appropriate node numbering
In SEMID: Identifiability of Linear Structural Equation Models
latentDigraphHasSimpleNumbering R Documentation
Checks that a LatentDigraph has appropriate node numbering
Description
Checks that the input latent digraph has nodes numbered from 1
to latentDigraph$numObserved()+latentDigraph$numLatents(). The first latentDigraph$numObserved()
nodes correspond to the observed nodes in the graph, all other nodes are considered unobserved.
Throws an error if this is not true.
Usage
latentDigraphHasSimpleNumbering(graph)
Arguments
graph
a LatentDigraph object representing
the latent-factor graph. All latent nodes in this graph should be
source nodes (i.e. have no parents).
SEMID documentation built on July 26, 2023, 5:40 p.m.
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
| latentDigraphHasSimpleNumbering | R Documentation |
Checks that a LatentDigraph has appropriate node numbering
Description
Checks that the input latent digraph has nodes numbered from 1 to latentDigraph$numObserved()+latentDigraph$numLatents(). The first latentDigraph$numObserved() nodes correspond to the observed nodes in the graph, all other nodes are considered unobserved. Throws an error if this is not true.
Usage
latentDigraphHasSimpleNumbering(graph)
Arguments
graph |
a |
R Package Documentation
Browse R Packages
We want your feedback!
Note that we can't provide technical support on individual packages. You should contact the package authors for that.
Embedding an R snippet on your website
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.