Moralize a directed acyclic graph
Moralize a directed acyclic graph which means marrying parents and dropping directions.
moralize(object, ...) ## Default S3 method: moralize(object, result = NULL, ...)
object |
A directed acyclic graph represented either as a
|
... |
Additional arguments, currently not used |
result |
The representation of the moralized graph. When NULL the representation will be the same as the input object. |
A moralized graph represented either as a graphNEL, a
dense matrix or a sparse dgCMatrix.
The workhorse is the moralizeMAT function.
Søren Højsgaard, sorenh@math.aau.dk
mcs, junction_tree, rip,
ug, dag
daG <- dag(~me+ve,~me+al,~ve+al,~al+an,~al+st,~an+st)
moralize(daG)
daG <- dag(~me+ve,~me+al,~ve+al,~al+an,~al+st,~an+st, result="matrix")
moralizeMAT(daG)
if (require(igraph)){
M <- matrix(c(1,2,3,3), nrow=2)
G <- graph.edgelist(M)
G
V(G)$name
moralize(G)
}Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.