listEdges: List the Edges of a Graph
In graph: graph: A package to handle graph data structures

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

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.

1	listEdges(object, dropNULL=TRUE)

`object`	An instance of the `graphNEL-class` class.
`dropNULL`	Should those node pairs with no edges be dropped from the returned list.

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

A named list of simpleEdge-class objects.

R. Gentleman

simpleEdge-class, edges

        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)