Remove the Upper Triangles of Adjacency Matrices in a Graph Stack
Returns the input graph stack, with the upper triangle entries removed/replaced as indicated.
upper.tri.remove(dat, remove.val=NA)
dat |
a graph or graph stack. |
remove.val |
the value with which to replace the existing upper triangles. |
upper.tri.remove is simply a convenient way to apply g[upper.tri(g)]<-remove.val to an entire stack of adjacency matrices at once.
The updated graph stack.
Carter T. Butts buttsc@uci.edu
#Generate a random graph stack g<-rgraph(3,5) #Remove the upper triangles g<-upper.tri.remove(g)
Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.