Symmetrizes the elements of `mats`

according to the rule in `rule`

.

1 | ```
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.

1 2 3 4 5 6 7 8 | ```
#Generate a graph
g<-rgraph(5)
#Weak symmetrization
symmetrize(g)
#Strong symmetrization
symmetrize(g,rule="strong")
``` |

Questions? Problems? Suggestions? Tweet to @rdrrHQ or email at ian@mutexlabs.com.

Please suggest features or report bugs with the GitHub issue tracker.

All documentation is copyright its authors; we didn't write any of that.