powered by
caugi
Checks if the given caugi graph is an undirected graph (UG).
is_ug(cg, force_check = FALSE)
A logical value indicating whether the graph is an UG.
A caugi object.
Logical; if TRUE, the function will test if the graph is an UG, 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_admg(), is_ag(), is_caugi(), is_cpdag(), is_dag(), is_empty_caugi(), is_mag(), is_pdag(), 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_admg()
is_ag()
is_caugi()
is_cpdag()
is_dag()
is_empty_caugi()
is_mag()
is_pdag()
m_separated()
markov_blanket()
neighbors()
nodes()
parents()
same_nodes()
spouses()
subgraph()
topological_sort()
cg_ug_class <- caugi( A %---% B, class = "UG" ) is_ug(cg_ug_class) # TRUE cg_not_ug <- caugi( A %-->% B, class = "DAG" ) is_ug(cg_not_ug) # FALSE
Run the code above in your browser using DataLab