inEdges                package:graph                R Documentation

_G_e_n_e_r_i_c _M_e_t_h_o_d _i_n_E_d_g_e_s

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

     Returns a list of all incoming edges for the specified nodes.

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

     inEdges(node, object)

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

    node: character vector of node names

  object: a 'graph' object

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

     If no 'node' argument is specified, 'inEdges' returns the incoming
     edges for all nodes in the graph.

     For an undirected graph, 'inEdges' returns all edges for the
     specified nodes.

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

     A list with length matching the length of 'node'.  If 'node' was
     missing, a list containing an element for each node in the graph.

     Each list element contains a character vector of node names giving
     the nodes that have outgoing edges to the node given by the name
     of the list element.

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

     R. Gentleman

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

     'removeNode', 'clearNode'

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

       V <- LETTERS[1:4]
       edL3 <- vector("list", length=4)
       for(i in 1:4)
         edL3[[i]] <- list(edges=(i%%4)+1, weights=i)
       names(edL3) <- V
       gR3 <- new("graphNEL", nodes=V, edgeL=edL3, "directed")
       inEdges(c("A", "B"), gR3)

