listEdges: List the Edges of a Graph

Description Usage Arguments Details Value Author(s) See Also Examples

View source: R/edgefunctions.R

Description

A list where each element contains all edges between two nodes, regardless of orientation. The list has names which are node pairs, in lexicographic order, and elements all edges between those nodes.

Usage

1
listEdges(object, dropNULL=TRUE)

Arguments

object

An instance of the graphNEL-class class.

dropNULL

Should those node pairs with no edges be dropped from the returned list.

Details

The function is currently only implemented for graphs of the graphNEL-class. The edges in the returned list are instances of the simpleEdge-class.

Value

A named list of simpleEdge-class objects.

Author(s)

R. Gentleman

See Also

simpleEdge-class, edges

Examples

1
2
3
4
5
6
7
8
9
        set.seed(123)
        V <- LETTERS[1:4]
        edL <- vector("list", length=4)
        names(edL) <- V
        toE <- LETTERS[4:1]
        for(i in 1:4) 
           edL[[i]] <- list(edges=5-i, weights=runif(1))
        gR <- graphNEL(nodes=V, edgeL=edL)
        listEdges(gR)

Bioconductor/graph documentation built on May 31, 2021, 8:28 p.m.