edge.betweenness: Vertex and edge betweenness centrality

In igraph/rigraph: Network Analysis and Visualization

Vertex and edge betweenness centrality

Description

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
)

Arguments

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 path length to consider when calculating the betweenness. If zero or negative then there is no such limit.

igraph/rigraph documentation built on May 19, 2024, 6:19 a.m.