| is_mpdag | R Documentation |
caugi graph an MPDAG?Checks if the given caugi graph is a
Maximally oriented Partially Directed Acyclic Graph
(MPDAG), i.e. a PDAG where no additional edge orientations
are implied by Meek's rules (R1–R4).
is_mpdag(cg)
cg |
A |
If the graph is not PDAG-compatible, the function returns FALSE.
A logical value indicating whether the graph is an MPDAG.
C. Meek (1995). Causal inference and causal explanation with background knowledge. In Proceedings of the Eleventh Conference on Uncertainty in Artificial Intelligence (UAI-95), pp. 403–411. Morgan Kaufmann.
Other queries:
ancestors(),
anteriors(),
children(),
components(),
descendants(),
districts(),
edge_types(),
edges(),
exogenous(),
is_acyclic(),
is_admg(),
is_ag(),
is_caugi(),
is_cpdag(),
is_dag(),
is_empty_caugi(),
is_mag(),
is_pdag(),
is_simple(),
is_ug(),
m_separated(),
markov_blanket(),
neighbors(),
nodes(),
parents(),
posteriors(),
same_nodes(),
spouses(),
subgraph(),
topological_sort()
cg_not_mpdag <- caugi(
A %---% B,
A %-->% C,
C %-->% B,
class = "PDAG"
)
is_mpdag(cg_not_mpdag) # FALSE
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.