inEdges: Generic Method inEdges
In vjcitn/graph: graph: A package to handle graph data structures

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

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

1	inEdges(node, object)

`node`	character vector of node names
`object`	a `graph` object

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.

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.

R. Gentleman

removeNode, clearNode

  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 <- graphNEL(nodes=V, edgeL=edL3, "directed")
  inEdges(c("A", "B"), gR3)