Symmetrize an Adjacency Matrix
Symmetrizes the elements of mats according to the rule in rule.
symmetrize(mats, rule="weak", return.as.edgelist=FALSE)
mats |
a graph or graph stack. |
rule |
one of “upper”, “lower”, “strong” or “weak”. |
return.as.edgelist |
logical; should the symmetrized graphs be returned in edgelist form? |
The rules used by symmetrize are as follows:
upper: Copy the upper triangle over the lower triangle
lower: Copy the lower triangle over the upper triangle
strong: i<->j iff i->j and i<-j (AND rule)
weak: i<->j iff i->j or i<-j (OR rule)
The symmetrized graph stack
Carter T. Butts buttsc@uci.edu
Wasserman, S., and Faust, K. (1994). Social Network Analysis: Methods and Applications. Cambridge: Cambridge University Press.
#Generate a graph g<-rgraph(5) #Weak symmetrization symmetrize(g) #Strong symmetrization symmetrize(g,rule="strong")
Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.