Description Usage Arguments Examples
Graph obtained from
x by (1) “marrying” (inserting an undirected
ede between) all nodes that have common children, and then replacing all edges
by undirected edges. If
x contains bidirected edges, then all sets of
nodes connected by a path containing only bidirected edges are treated like a
single node (see Examples).
the input graph, a DAG, MAG, or PDAG.
1 2 3 4
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.