Last chance! 50% off unlimited learning
Sale ends in
Returns the input graph stack, with the upper triangle entries removed/replaced as indicated.
upper.tri.remove(dat, remove.val=NA)a graph or graph stack.
the value with which to replace the existing upper triangles.
The updated graph stack.
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.
# NOT RUN {
#Generate a random graph stack
g<-rgraph(3,5)
#Remove the upper triangles
g<-upper.tri.remove(g)
# }
Run the code above in your browser using DataLab