Description Usage Arguments Details Value Note Author(s) See Also Examples
A RIP (running intersection property) ordering of the cliques is also called a perfect ordering. If the graph is not chordal, then no such ordering exists.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 | rip(object, root = NULL, nLevels = NULL)
## S3 method for class 'graphNEL'
rip(object, root = NULL, nLevels = NULL)
## S3 method for class 'matrix'
rip(object, root = NULL, nLevels = NULL)
## S3 method for class 'Matrix'
rip(object, root = NULL, nLevels = NULL)
ripMAT(amat, root = NULL, nLevels = NULL)
jTree(object, ...)
## S3 method for class 'graphNEL'
jTree(object, method="mcwh",nLevels=rep(2,length(nodes(object))),...)
## S3 method for class 'matrix'
jTree(object, method="mcwh",nLevels=rep(2,ncol(object)),...)
## S3 method for class 'Matrix'
jTree(object, method="mcwh",nLevels=rep(2,ncol(object)),...)
|
object |
An undirected graph represented either as a 'graphNEL', a 'matrix' or a sparse 'dgCMatrix' |
root |
A vector of variables. The first variable in the perfect ordering will be the first variable on 'root'. The ordering of the variables given in 'root' will be followed as far as possible. |
nLevels |
Typically, the number of levels of the variables (nodes) when these are discrete. Used in determining the triangulation using a "minimum clique weight heuristic". See section 'details'. |
amat |
Adjacency matrix |
method |
The triangulation method, |
... |
Additional arguments; currently not used |
The RIP ordering is obtained by first ordering the variables linearly
with maximum cardinality search (by mcs
). The root argument is
transfered to mcs
as a way of controlling which clique will be
the first in the RIP ordering.
The jTree
(for "junction tree") is just a wrapper for a call of
triangulate
followed by a call of rip
.
rip
returns a list (an object of class ripOrder
. A print method exists for
such objects.)
The workhorse is the ripMAT
function.
S<f8>ren H<f8>jsgaard, sorenh@math.aau.dk
mcs
triangulate
moralize
ug
,
dag
1 2 3 4 5 6 7 8 9 10 11 |
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.