Vectorization of Adjacency Matrices
gvectorize takes an input graph set and converts it into a corresponding number of vectors by row concatenation.
gvectorize(mats, mode="digraph", diag=FALSE, censor.as.na=TRUE)
mats |
one or more input graphs. |
mode |
“digraph” if data is taken to be directed, else “graph”. |
diag |
boolean indicating whether diagonal entries (loops) are taken to contain meaningful data. |
censor.as.na |
if |
The output of gvectorize is a matrix in which each column corresponds to an input graph, and each row corresponds to an edge. The columns of the output matrix are formed by simple row-concatenation of the original adjacency matrices, possibly after removing cells which are not meaningful (if censor.as.na==FALSE). This is useful when preprocessing edge sets for use with glm or the like.
An nxk matrix, where n is the number of arcs and k is the number of graphs; if censor.as.na==FALSE, n will be reflect the relevant number of uncensored arcs.
Carter T. Butts buttsc@uci.edu
#Draw two random graphs g<-rgraph(10,2) #Examine the vectorized form of the adjacency structure gvectorize(g)
Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.