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