powered by
caugi
Checks if the given caugi graph is an Acyclic Directed Mixed Graph (ADMG).
An ADMG contains only directed (-->) and bidirected (<->) edges, and the directed part must be acyclic.
-->
<->
is_admg(cg, force_check = FALSE)
A logical value indicating whether the graph is an ADMG.
A caugi object.
Logical; if TRUE, the function will test if the graph is an ADMG, if FALSE (default), it will look at the graph class and match it, if possible.
TRUE
FALSE
Other queries: ancestors(), anteriors(), children(), descendants(), districts(), edge_types(), edges(), exogenous(), is_acyclic(), is_ag(), is_caugi(), is_cpdag(), is_dag(), is_empty_caugi(), is_mag(), is_pdag(), is_ug(), m_separated(), markov_blanket(), neighbors(), nodes(), parents(), same_nodes(), spouses(), subgraph(), topological_sort()
ancestors()
anteriors()
children()
descendants()
districts()
edge_types()
edges()
exogenous()
is_acyclic()
is_ag()
is_caugi()
is_cpdag()
is_dag()
is_empty_caugi()
is_mag()
is_pdag()
is_ug()
m_separated()
markov_blanket()
neighbors()
nodes()
parents()
same_nodes()
spouses()
subgraph()
topological_sort()
cg_admg <- caugi( A %-->% B, A %<->% C, class = "ADMG" ) is_admg(cg_admg) # TRUE cg_dag <- caugi( A %-->% B, class = "DAG" ) is_admg(cg_dag) # TRUE (DAGs are valid ADMGs)
Run the code above in your browser using DataLab