Usage
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"))
Arguments
graph
The graph to convert.
type
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.
attr
Either NULL
or a character string giving an edge
attribute name. If NULL
a traditional adjacency matrix is returned.
If not NULL
then the values of the given edge attribute are included
in the adjacency matrix. If th
edges
Logical scalar, whether to return the edge ids in the matrix.
For non-existant edges zero is returned.
names
Logical constant, whether to assign row and column names
to the matrix. These are only assigned if the name
vertex attribute
is present in the graph.
sparse
Logical scalar, whether to create a sparse matrix. The
Matrix
package must be installed for creating sparse
matrices.