Description Usage Arguments Details Author(s) See Also Examples
Make operations on undirected and directed acyclic graphs (which are
represented as graphNEL
objects.
1 2 3 4 5 6 7 8 9 10 11 12 | ancestors(set, object)
ancestralGraph(set, object)
ancestralSet(set, object)
children(set, object)
closure(set, object)
is.complete(object, set)
is.decomposition(set, set2, set3, object)
is.simplicial(set, object)
parents(set, object)
simplicialNodes(object)
as.adjMAT(object, result="matrix")
graphNEL2ftM(object)
|
set, set2, set3 |
Vectors of sets |
object |
A graphNEL object |
result |
Either |
Notice: as.adjMAT(g)
does the same as as(g, "matrix")
but
considerably faster.
maxCliqueMAT
applied to an adjacency matrix does the same as
maxClique
applied to a graphNEL; but maxCliqueMAT is is
considerably faster. If the matrix is sparse, it will be coerced to a
non-sparse matrix.
S<f8>ren H<f8>jsgaard, sorenh@math.aau.dk
edgeList
nonEdgeList
mcs
rip
moralize
jTree
1 2 3 4 5 6 7 8 9 | uG <- ug(~me:ve,~me:al,~ve:al,~al:an,~al:st,~an:st)
closure("me", uG)
maxClique(uG)
amat1 <- as.adjMAT(uG)
maxCliqueMAT(amat1)
amat1 <- as.adjMAT(uG, result="Matrix")
maxCliqueMAT(amat1)
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.