| graphAM-class {graph} | R Documentation |
A graph class where node and edge information is represented as an
adjacency matrix. The adjacency matrix is square and element
adjMat[i, j] is non-zero if there is an edge from node i to
node j.
Objects can be created by calls of the form new("graphAM", adjMat, edgemode, values).
adjMat:"matrix" describing the
graph structure. The colnames of the matrix will be used as
node names for the graph if present.edgemode:"character" vector specifying
whether the graph is "directed" or "undirected".edgeData:nodeData:
Class "graph", directly.
signature(from = "character", to = "character", graph = "graphAM", weights = "missing"): ... signature(object = "graphAM", nodes = "character"): ... signature(node = "character", object = "graphAM"): ... signature(from = "graphAM", to = "graphNEL"): ... signature(object = "graphAM", which = "missing"): ... signature(object = "graphAM", which = "character"): ... signature(.Object = "graphAM"): ... signature(node = "character", object =
"graphNEL"): Return the incoming edges for the specified
nodes. See inEdges.signature(object = "graphAM", from = "character", to = "character"): ... signature(object = "graphAM", value = "character"): ... signature(object = "graphAM"): ... signature(graph = "graphAM"): ... signature(object = "graphAM"): ... signature(from = "character", to = "character", graph = "graphAM"): ... signature(node = "character", object = "graphAM"): ... Seth Falcon
mat <- matrix(c(0, 0, 1, 1, 0, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0),
byrow=TRUE, ncol=4)
rownames(mat) <- letters[1:4]
colnames(mat) <- letters[1:4]
g1 <- new("graphAM", adjMat=mat)