
Last chance! 50% off unlimited learning
Sale ends in
Returns the edges of a graph (or edges not in a graph) where the graph can be either a `graphNEL` object, an `igraph` object or an adjacency matrix.
edgeList(object, matrix = FALSE)edgeListMAT(adjmat, matrix = FALSE)
nonEdgeList(object, matrix = FALSE)
nonEdgeListMAT(adjmat, matrix = FALSE)
A `graphNEL` object, an `igraph` object, a dense matrix or a sparse `dgCMatrix` (the two latter representing an adjacency matrix).
If TRUE the result is a matrix; otherwise the result is a list.
An adjacency matrix.
# NOT RUN {
## A graph with edges
g <- ug(~a:b + b:c + c:d)
gm <- as(g, "matrix")
edgeList(g)
edgeList(gm)
edgeListMAT(gm)
edgeList(g, matrix=TRUE)
edgeList(gm, matrix=TRUE)
edgeListMAT(gm, matrix=TRUE)
nonEdgeList(g)
nonEdgeList(gm)
nonEdgeListMAT(gm)
## A graph without edges
g <- ug(~a + b + c)
gm <- as(g, "matrix")
edgeList(g)
edgeList(gm)
edgeListMAT(gm)
edgeList(g, matrix=TRUE)
edgeList(gm, matrix=TRUE)
edgeListMAT(gm, matrix=TRUE)
nonEdgeList(g)
nonEdgeList(gm)
nonEdgeListMAT(gm)
# }
Run the code above in your browser using DataLab