listEdges               package:graph               R Documentation

_L_i_s_t _t_h_e _E_d_g_e_s _o_f _a _G_r_a_p_h

_D_e_s_c_r_i_p_t_i_o_n:

     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.

_U_s_a_g_e:

     listEdges(object, dropNULL=TRUE)

_A_r_g_u_m_e_n_t_s:

  object: An instance of the 'graphNEL-class' class. 

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

_D_e_t_a_i_l_s:

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

_V_a_l_u_e:

     A named list of 'simpleEdge-class' objects.

_A_u_t_h_o_r(_s):

     R. Gentleman

_S_e_e _A_l_s_o:

     'simpleEdge-class', 'edges'

_E_x_a_m_p_l_e_s:

             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 <- new("graphNEL", nodes=V, edgeL=edL)
             listEdges(gR)

