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 i
Value
A vcount(graph) by vcount(graph) numeric matrix for
get.adjacency. (This can be huge!)
A ecount(graph) by 2 numeric matrix for get.edgelist.
Details
get.adjacency returns the adjacency matrix of a graph.
get.edgelist returns the list of edges in a graph.