Neighborhood of graph vertices — neighborhood.size • igraph

neighborhood.size() was renamed to ego_size() to create a more consistent API.

Usage

neighborhood.size(
  graph,
  order = 1,
  nodes = V(graph),
  mode = c("all", "out", "in"),
  mindist = 0
)

graph: The input graph.
order: Integer giving the order of the neighborhood.
nodes: The vertices for which the calculation is performed.
mode: Character constant, it specifies how to use the direction of the edges if a directed graph is analyzed. For ‘out’ only the outgoing edges are followed, so all vertices reachable from the source vertex in at most order steps are counted. For ‘"in"’ all vertices from which the source vertex is reachable in at most order steps are counted. ‘"all"’ ignores the direction of the edges. This argument is ignored for undirected graphs.
mindist: The minimum distance to include the vertex in the result.