Description Usage Arguments Details Value Author(s) Examples
Find all unshielded triples in an undirected graph, q, i.e., the ordered ((x,y,z) with x < z) list of all the triples in the graph.
1 
g 
adjacency matrix of type amat.cpdag representing the
skeleton; since a skeleton consists only of undirected edges,

check 
logical indicating that the symmetry of 
A triple of nodes x
, y
and z
is
“unshielded”, if (all of these are true):
x
and y
are connected;
y
and z
are connected;
x
and z
are not connected.
unshTripl 
Matrix with 3 rows containing in each column an unshielded triple 
unshVect 
Vector containing the unique number for each column in unshTripl (for internal use only) 
Diego Colombo, Markus Kalisch ([email protected]), and Martin Maechler
1 2 3 4 5 6 7 8 9 10 11 12 13 14  data(gmG)
if (require(Rgraphviz)) {
## show graph
plot(gmG$g, main = "True DAG")
}
## prepare skeleton use in example
g < wgtMatrix(gmG$g) ## compute weight matrix
g < 1*(g != 0) # wgts > 0/1; still lower triangular
print.table(g, zero.print=".")
skel < g + t(g) ## adjacency matrix of skeleton
## estimate unshielded triples  there are 13 :
(uTr < find.unsh.triple(skel))

Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.