networkx.algorithms.centrality.edge_betweenness_centrality_subset¶

edge_betweenness_centrality_subset
(G, sources, targets, normalized=False, weight=None)[source]¶ Compute betweenness centrality for edges for a subset of nodes.
\[c_B(v) =\sum_{s\in S,t \in T} \frac{\sigma(s, te)}{\sigma(s, t)}\]where \(S\) is the set of sources, \(T\) is the set of targets, \(\sigma(s, t)\) is the number of shortest \((s, t)\)paths, and \(\sigma(s, te)\) is the number of those paths passing through edge \(e\) 2.
 Parameters
G (graph) – A networkx graph.
sources (list of nodes) – Nodes to use as sources for shortest paths in betweenness
targets (list of nodes) – Nodes to use as targets for shortest paths in betweenness
normalized (bool, optional) – If True the betweenness values are normalized by
2/(n(n1))
for graphs, and1/(n(n1))
for directed graphs wheren
is the number of nodes in G.weight (None or string, optional (default=None)) – If None, all edge weights are considered equal. Otherwise holds the name of the edge attribute used as weight.
 Returns
edges – Dictionary of edges with Betweenness centrality as the value.
 Return type
dictionary
See also
betweenness_centrality()
,edge_load()
Notes
The basic algorithm is from 1.
For weighted graphs the edge weights must be greater than zero. Zero edge weights can produce an infinite number of equal length paths between pairs of nodes.
The normalization might seem a little strange but it is the same as in edge_betweenness_centrality() and is designed to make edge_betweenness_centrality(G) be the same as edge_betweenness_centrality_subset(G,sources=G.nodes(),targets=G.nodes()).
References
 1
Ulrik Brandes, A Faster Algorithm for Betweenness Centrality. Journal of Mathematical Sociology 25(2):163177, 2001. http://www.inf.unikonstanz.de/algo/publications/bfabc01.pdf
 2
Ulrik Brandes: On Variants of ShortestPath Betweenness Centrality and their Generic Computation. Social Networks 30(2):136145, 2008. http://www.inf.unikonstanz.de/algo/publications/bvspbc08.pdf