Checks if the given caugi graph is a
Directed Acyclic Graph (DAG).
Usage
is_dag(cg, force_check = FALSE)
Arguments
- cg
A caugi object.
- force_check
Logical; if TRUE, the function will test if the graph is
a DAG, if FALSE (default), it will look at the graph class and match
it, if possible.
Value
A logical value indicating whether the graph is a DAG.
See also
Other queries:
ancestors(),
children(),
descendants(),
districts(),
edge_types(),
edges(),
exogenous(),
is_acyclic(),
is_admg(),
is_caugi(),
is_cpdag(),
is_empty_caugi(),
is_pdag(),
is_ug(),
m_separated(),
markov_blanket(),
neighbors(),
nodes(),
parents(),
same_nodes(),
spouses(),
subgraph()
Examples
cg_dag_class <- caugi(
A %-->% B,
class = "DAG"
)
is_dag(cg_dag_class) # TRUE
#> [1] TRUE
cg_dag_but_pdag_class <- caugi(
A %-->% B,
class = "PDAG"
)
is_dag(cg_dag_but_pdag_class) # TRUE
#> [1] TRUE
cg_cyclic <- caugi(
A %-->% B,
B %-->% C,
C %-->% A,
class = "UNKNOWN",
simple = FALSE
)
is_dag(cg_cyclic) # FALSE
#> [1] FALSE
cg_undirected <- caugi(
A %---% B,
class = "UNKNOWN"
)
is_dag(cg_undirected) # FALSE
#> [1] FALSE
