List of vertices and their parents for graph.
Get list of vertices and their parents for graph.
vchi(object, getv = TRUE, forceCheck = TRUE) vchiMAT(object, getv = TRUE, forceCheck = TRUE) vpar(object, getv = TRUE, forceCheck = TRUE) vparMAT(object, getv = TRUE, forceCheck = TRUE)
object |
An object representing a graph. Valid objects are an adjacency matrix or as a graphNEL. |
getv |
The result is by default a list of vectors of the form
|
forceCheck |
Logical indicating if it should be checked that the object is a DAG. |
A list of vectors where each vector will have the form
(v, pa1, pa2, ... paN) where pa1, pa2, ... paN
are the parents of v.
## DAGs
dagMAT <- dag(~a:b:c + c:d:e, result="matrix")
dagNEL <- dag(~a:b:c + c:d:e, result="graphNEL")
vpar(dagMAT)
vpar(dagNEL)
vpar(dagMAT, getv=FALSE)
vpar(dagNEL, getv=FALSE)
## Undirected graphs
ugMAT <- ug(~a:b:c + c:d:e, result="matrix")
ugNEL <- ug(~a:b:c + c:d:e, result="graphNEL")
## Not run:
## This will fail because the adjacency matrix is symmetric and the
## graphNEL has undirected edges
vpar(ugMAT)
vpar(ugNEL)
## End(Not run)
## When forceCheck is FALSE, it will not be detected that the graphs are undirected.
vpar(ugMAT, forceCheck=FALSE)
vpar(ugNEL, forceCheck=FALSE)
## Bidirected graphs
## This is, for graphNELs, the same as working with bidirected edges:
if (require(graph)){
graph::edgemode(ugNEL)
graph::edgemode(ugNEL) <- "directed"
graph::edgemode(ugNEL)
vpar(ugNEL,FALSE)
}Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.