Returns the input graph set, with the lower triangle entries removed/replaced as indicated.
lower.tri.remove(dat, remove.val=NA)
The updated graph set.
one or more input graphs.
the value with which to replace the existing lower triangles.
Carter T. Butts buttsc@uci.edu
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.
lower.tri.remove
g[lower.tri(g)]<-remove.val
lower.tri, upper.tri.remove, diag.remove
lower.tri
upper.tri.remove
diag.remove
#Generate a random graph stack g<-rgraph(3,5) #Remove the lower triangles g<-lower.tri.remove(g)
Run the code above in your browser using DataLab