sna (version 2.4)

lower.tri.remove: Remove the Lower Triangles of Adjacency Matrices in a Graph Stack

Description

Returns the input graph set, with the lower triangle entries removed/replaced as indicated.

Usage

lower.tri.remove(dat, remove.val=NA)

Arguments

dat

one or more input graphs.

remove.val

the value with which to replace the existing lower triangles.

Value

The updated graph set.

Details

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.

See Also

lower.tri, upper.tri.remove, diag.remove

Examples

# NOT RUN {
#Generate a random graph stack
g<-rgraph(3,5)
#Remove the lower triangles
g<-lower.tri.remove(g)

# }