Get adjacency or edgelist representation of the network
1 2 3
object of class igraph, the network
character, type of matrix to return, currently "adjacency" or "edgelist" are supported
character, name of the edge attribute to use to fill in the cells of the adjacency matrix
logical, whether to return a sparse matrix
other arguments to/from other methods
matrix.type is "edgelist" a two-column numeric
edgelist matrix is returned. The value of
attrname is ignored.
matrix.type is "adjacency" then a square
adjacency matrix is returned. If
NULL (default) the matrix is binary. Otherwise
attrname can be a name of edge attribute of
x. In that case the cells of the results are the
values of that attribute.
Other arguments passed through
... are passed to
get.edgelist depending on the value
Depending on the value of
matrix.type either a
square adjacency matrix or a two-column numeric matrix
representing the edgelist.
1 2 3 4 5