Convert a graph to an adjacency matrix
Sometimes it is useful to work with a standard representation of a graph, like an adjacency matrix.
as_adjacency_matrix(graph, type = c("both", "upper", "lower"), attr = NULL, edges = FALSE, names = TRUE, sparse = igraph_opt("sparsematrices"))
as_adj(graph, type = c("both", "upper", "lower"), attr = NULL, edges = FALSE, names = TRUE, sparse = igraph_opt("sparsematrices"))
- The graph to convert.
- Gives how to create the adjacency matrix for undirected graphs.
It is ignored for directed graphs. Possible values:
upper: the upper right triangle of the matrix is used,
lower: the lower left triangle of the matrix is used.
NULLor a character string giving an edge attribute name. If
NULLa traditional adjacency matrix is returned. If not
NULLthen the values of the given edge attribute are included in the adjacency matrix. If th
- Logical scalar, whether to return the edge ids in the matrix. For non-existant edges zero is returned.
- Logical constant, whether to assign row and column names
to the matrix. These are only assigned if the
namevertex attribute is present in the graph.
- Logical scalar, whether to create a sparse matrix. The
package must be installed for creating sparse matrices.
as_adjacency_matrix returns the adjacency matrix of a graph, a
regular matrix if
FALSE, or a sparse matrix, as
defined in the
vcount(graph)(usually) numeric matrix.
g <- sample_gnp(10, 2/10) as_adjacency_matrix(g) V(g)$name <- letters[1:vcount(g)] as_adjacency_matrix(g) E(g)$weight <- runif(ecount(g)) as_adjacency_matrix(g, attr="weight")