| is_dag | R Documentation |
caugi graph a DAG?Checks if the given caugi graph is a
Directed Acyclic Graph (DAG).
is_dag(cg, force_check = FALSE)
cg |
A |
force_check |
Logical; if |
A logical value indicating whether the graph is a DAG.
Other queries:
ancestors(),
anteriors(),
children(),
components(),
descendants(),
districts(),
edge_types(),
edges(),
exogenous(),
is_acyclic(),
is_admg(),
is_ag(),
is_caugi(),
is_cpdag(),
is_empty_caugi(),
is_mag(),
is_mpdag(),
is_pdag(),
is_simple(),
is_ug(),
m_separated(),
markov_blanket(),
neighbors(),
nodes(),
parents(),
posteriors(),
same_nodes(),
spouses(),
subgraph(),
topological_sort()
cg_dag_class <- caugi(
A %-->% B,
class = "DAG"
)
is_dag(cg_dag_class) # TRUE
cg_dag_but_pdag_class <- caugi(
A %-->% B,
class = "PDAG"
)
is_dag(cg_dag_but_pdag_class) # TRUE
cg_cyclic <- caugi(
A %-->% B,
B %-->% C,
C %-->% A,
class = "UNKNOWN",
simple = FALSE
)
is_dag(cg_cyclic) # FALSE
cg_undirected <- caugi(
A %---% B,
class = "UNKNOWN"
)
is_dag(cg_undirected) # FALSE
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.