wg/8FdZddlmZddlmZmZddlmZddlZ ddl m Z ddl m Z ddlmZd d gZe d e j"d  ddZe de j"d ddZdZdZdZdZdZddZddZedddZy)z Betweenness centrality measures.)deque)heappopheappush)countN)_weight_function)py_random_state)not_implemented_forbetweenness_centralityedge_betweenness_centralityweight) edge_attrsctj|d}||}n)|jt|j |}|D]O}|t ||\} } } } nt |||\} } } } |rt|| | | |\}} >t|| | | |\}} Qt|t|||j||}|S)uCompute the shortest-path betweenness centrality for nodes. Betweenness centrality of a node $v$ is the sum of the fraction of all-pairs shortest paths that pass through $v$ .. math:: c_B(v) =\sum_{s,t \in V} \frac{\sigma(s, t|v)}{\sigma(s, t)} where $V$ is the set of nodes, $\sigma(s, t)$ is the number of shortest $(s, t)$-paths, and $\sigma(s, t|v)$ is the number of those paths passing through some node $v$ other than $s, t$. If $s = t$, $\sigma(s, t) = 1$, and if $v \in {s, t}$, $\sigma(s, t|v) = 0$ [2]_. Parameters ---------- G : graph A NetworkX graph. k : int, optional (default=None) If k is not None use k node samples to estimate betweenness. The value of k <= n where n is the number of nodes in the graph. Higher values give better approximation. normalized : bool, optional If True the betweenness values are normalized by `2/((n-1)(n-2))` for graphs, and `1/((n-1)(n-2))` for directed graphs where `n` 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. Weights are used to calculate weighted shortest paths, so they are interpreted as distances. endpoints : bool, optional If True include the endpoints in the shortest path counts. seed : integer, random_state, or None (default) Indicator of random number generation state. See :ref:`Randomness`. Note that this is only used if k is not None. Returns ------- nodes : dictionary Dictionary of nodes with betweenness centrality as the value. See Also -------- edge_betweenness_centrality load_centrality Notes ----- The algorithm is from Ulrik Brandes [1]_. See [4]_ for the original first published version and [2]_ for details on algorithms for variations and related metrics. For approximate betweenness calculations set k=#samples to use k nodes ("pivots") to estimate the betweenness values. For an estimate of the number of pivots needed see [3]_. 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 total number of paths between source and target is counted differently for directed and undirected graphs. Directed paths are easy to count. Undirected paths are tricky: should a path from "u" to "v" count as 1 undirected path or as 2 directed paths? For betweenness_centrality we report the number of undirected paths when G is undirected. For betweenness_centrality_subset the reporting is different. If the source and target subsets are the same, then we want to count undirected paths. But if the source and target subsets differ -- for example, if sources is {0} and targets is {1}, then we are only counting the paths in one direction. They are undirected paths but we are counting them in a directed way. To count them as undirected paths, each should count as half a path. This algorithm is not guaranteed to be correct if edge weights are floating point numbers. As a workaround you can use integer numbers by multiplying the relevant edge attributes by a convenient constant factor (eg 100) and converting to integers. References ---------- .. [1] Ulrik Brandes: A Faster Algorithm for Betweenness Centrality. Journal of Mathematical Sociology 25(2):163-177, 2001. https://doi.org/10.1080/0022250X.2001.9990249 .. [2] Ulrik Brandes: On Variants of Shortest-Path Betweenness Centrality and their Generic Computation. Social Networks 30(2):136-145, 2008. https://doi.org/10.1016/j.socnet.2007.11.001 .. [3] Ulrik Brandes and Christian Pich: Centrality Estimation in Large Networks. International Journal of Bifurcation and Chaos 17(7):2303-2318, 2007. https://dx.doi.org/10.1142/S0218127407018403 .. [4] Linton C. Freeman: A set of measures of centrality based on betweenness. Sociometry 40: 35–41, 1977 https://doi.org/10.2307/3033543 ) normalizeddirectedk endpoints) dictfromkeyssamplelistnodes"_single_source_shortest_path_basic"_single_source_dijkstra_path_basic_accumulate_endpoints_accumulate_basic_rescalelen is_directed) Grrr rseed betweennessrsSPsigma_s o/home/mcse/projects/flask/flask-venv/lib/python3.12/site-packages/networkx/algorithms/centrality/betweenness.pyr r sd--3'Ky DOQ/  L >?1ENAq%?1fMNAq% 2;1eQONK.{Aq%KNK L A  K ctj|d}|jtj|jd||}n)|j t |j |}|D]7}|t||\}} } } nt|||\}} } } t||| | |}9|D]} || =t|t|||j}|jrt|||}|S)aCompute betweenness centrality for edges. Betweenness centrality of an edge $e$ is the sum of the fraction of all-pairs shortest paths that pass through $e$ .. math:: c_B(e) =\sum_{s,t \in V} \frac{\sigma(s, t|e)}{\sigma(s, t)} where $V$ is the set of nodes, $\sigma(s, t)$ is the number of shortest $(s, t)$-paths, and $\sigma(s, t|e)$ is the number of those paths passing through edge $e$ [2]_. Parameters ---------- G : graph A NetworkX graph. k : int, optional (default=None) If k is not None use k node samples to estimate betweenness. The value of k <= n where n is the number of nodes in the graph. Higher values give better approximation. normalized : bool, optional If True the betweenness values are normalized by $2/(n(n-1))$ for graphs, and $1/(n(n-1))$ for directed graphs where $n$ 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. Weights are used to calculate weighted shortest paths, so they are interpreted as distances. seed : integer, random_state, or None (default) Indicator of random number generation state. See :ref:`Randomness`. Note that this is only used if k is not None. Returns ------- edges : dictionary Dictionary of edges with betweenness centrality as the value. See Also -------- betweenness_centrality edge_load Notes ----- The algorithm is from Ulrik Brandes [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. References ---------- .. [1] A Faster Algorithm for Betweenness Centrality. Ulrik Brandes, Journal of Mathematical Sociology 25(2):163-177, 2001. https://doi.org/10.1080/0022250X.2001.9990249 .. [2] Ulrik Brandes: On Variants of Shortest-Path Betweenness Centrality and their Generic Computation. Social Networks 30(2):136-145, 2008. https://doi.org/10.1016/j.socnet.2007.11.001 r)rr)r )rrupdateedgesrrrrr_accumulate_edges _rescale_err is_multigraph_add_edge_keys) r!rrr r"r#rr$r%r&r'r(ns r)r r sL--3'Kt}}QWWY45y DOQ/ E >?1ENAq%?1fMNAq%' Q5!D E NSV Q]]_K $Q FC r*cg}i}|D]}g||< tj|d}i}d||<d||<t|g}|r|j}|j |||}||} ||D]L} | |vr|j | |dz|| <|| |dzk(s,|| xx| z cc<|| j |N|r||||fS)Nr?r)rrrpopleftappend) r!r$r%r&vr'DQDvsigmavws r)rrs A A ! MM!S !E AE!H AaD qc A IIK  qTq1 Az Av!trAv~aF"! A    a>r*cvt||}g}i}|D]}g||< tj|d}i}d||<t}t} |di} t } g} || dt | ||f| r| | \} }}}||vr||xx||z cc<|j|| ||<||jD]v\}}| ||||z}||vr3|| vs|| |kr'|| |<|| |t | ||fd||<|g||<J|| |k(sS||xx||z cc<||j|x| r||||fS)Nrr5r) rrrrrrnextr8items)r!r$r r%r&r9r'r:pushpopseencr;distr(predr>edgedatavw_dists r)rrs a (F A A ! MM!S !E AE!H D C q6D A AQQA   Vq$ 6  aE$K  !Q4::< KAxVAq(33Gzq}$q'0A!QQ$q'1a01as!DG#aE!H$! A  " a>r*ctj|d}|rS|j}d||z||z }||D]}||xx|||zz cc<||k7r||xx||z cc<|rS||fSNrr6rrrC r#r%r&r'r$deltar>coeffr9s r)rr=s MM!Q E EEGU1Xq)1 )A !Ha5( (H ) 6 NeAh &N   r*c||xxt|dz z cc<tj|d}|rV|j}d||z||z }||D]}||xx|||zz cc<||k7r||xx||dzz cc<|rV||fS)Nr6r)rrrrCrMs r)rrIsNc!fqj N MM!Q E EEGU1Xq)1 )A !Ha5( (H ) 6 NeAhl *N   r*c*tj|d}|rz|j}d||z||z }||D]<}|||z} ||f|vr|||fxx| z cc<n|||fxx| z cc<||xx| z cc<>||k7r||xx||z cc<|rz|SrKrL) r#r%r&r'r$rNr>rOr9rEs r)r/r/Vs MM!Q E EEGU1Xq)1 Aa5 A1v[(QF#q(#QF#q(# !HMH   6 NeAh &N  r*c|r-|r|dkrd}n*d||dz zz }n|dkrd}nd|dz |dz zz }n|sd}nd}||||z|z }|D]}||xx|zcc<|S)Nr6?)r#r3rrrrscaler9s r)rrgs 1uQ!a%[) !VE!a%AE*+EEE  =AIME $A Ne #N $ r*c|r|dkrd}nd||dz zz }n|sd}nd}||||z|z }|D]}||xx|zcc<|S)Nr6rTrU)r#r3rrrrVr9s r)r0r0sk 6Ea!e%EEE  =AIME $A Ne #N $ r*graphc (t||}tj|jd}|D][\}}|||}||||}|D cgc]} |||| || i|k(s| } } |||ft | z } | D] } | |||| f< ]|Scc} w)a,Adds the corrected betweenness centrality (BC) values for multigraphs. Parameters ---------- G : NetworkX graph. betweenness : dictionary Dictionary mapping adjacent node tuples to betweenness centrality values. weight : string or function See `_weight_function` for details. Defaults to `None`. Returns ------- edges : dictionary The parameter `betweenness` including edges with keys and their betweenness centrality values. The BC value is divided among edges of equal weight. r)rrrr.r) r!r#r _weightedge_bcur9dwtrkeysbcs r)r2r2s,q&)GmmAGGS)G$1 aDG Q1 ?a1q!A$i 8B >?? !Q 3t9 , $A!#GQ1I  $ $ N @s B#B)NTNFN)NTNN)FNF)FN)N)__doc__ collectionsrheapqrr itertoolsrnetworkxnx+networkx.algorithms.shortest_paths.weightedrnetworkx.utilsrnetworkx.utils.decoratorsr __all__ _dispatchabler r rrrrr/rr0r2rUr*r)rls&#H*9 #%B CX&CGI'IXX&['[B2!H  "2&W  r*