Vertex and edge betweenness centrality — edge.betweenness • igraph

edge.betweenness() was renamed to edge_betweenness() to create a more consistent API.

Usage

edge.betweenness(
  graph,
  e = E(graph),
  directed = TRUE,
  weights = NULL,
  cutoff = -1
)

graph: The graph to analyze.
e: The edges for which the edge betweenness will be calculated.
directed: Logical, whether directed paths should be considered while determining the shortest paths.
weights: Optional positive weight vector for calculating weighted betweenness. If the graph has a weight edge attribute, then this is used by default. Weights are used to calculate weighted shortest paths, so they are interpreted as distances.
cutoff: The maximum shortest path length to consider when calculating betweenness. If negative, then there is no such limit.