Description Usage Arguments Details Value Author(s) See Also Examples
Returns the edges of a graph (or edges not in a graph) where the graph can be either a graphNEL object or an adjacency matrix.
1 2 3 4 5 6 7 8 9 10 11 12 | edgeList(object, matrix = FALSE)
## S3 method for class 'graphNEL'
edgeList(object, matrix = FALSE)
## S3 method for class 'matrix'
edgeList(object, matrix = FALSE)
nonEdgeList(object, matrix = FALSE)
## S3 method for class 'graphNEL'
nonEdgeList(object, matrix = FALSE)
## S3 method for class 'matrix'
nonEdgeList(object, matrix = FALSE)
edgeListMAT(adjmat, matrix = FALSE, edgemode="undirected")
nonEdgeListMAT(adjmat, matrix = FALSE)
|
object |
A graphNEL object or an adjacency matrix. |
adjmat |
An adjacency matrix. |
matrix |
If TRUE the result is a matrix; otherwise the result is a list. |
edgemode |
Can be "directed" or "undirected". |
If object is a matrix, then edgeList() checks if object is symmetrical. If so it is assumed that the graph is undirected; otherwise the graph is assumed to be directed.
The workhorse is edgeListMAT.
A list or a matrix with edges.
S<f8>ren H<f8>jsgaard, sorenh@math.aau.dk
as.adjMAT
mcs
rip
moralize
jTree
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 | ## A graph with edges
g <- ug(~a:b+b:c+c:d)
gm <- as.adjMAT(g)
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.adjMAT(g)
edgeList(g)
edgeList(gm)
edgeListMAT(gm)
edgeList(g, matrix=TRUE)
edgeList(gm, matrix=TRUE)
edgeListMAT(gm, matrix=TRUE)
nonEdgeList(g)
nonEdgeList(gm)
nonEdgeListMAT(gm)
|
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.