wg8mdZddlmZddlZddlmZmZmZddl m Z gdZ ejddd Z d Zejd dd Zd Zd ZejdddZejdZe dejdZe dejdZy)zGroup centrality measures.)deepcopyN)_accumulate_endpoints"_single_source_dijkstra_path_basic"_single_source_shortest_path_basic)not_implemented_for)group_betweenness_centralitygroup_closeness_centralitygroup_degree_centralitygroup_in_degree_centralitygroup_out_degree_centralityprominent_groupweight) edge_attrsc  g}d}tfd|Dr|g}d}|Dchc] }|D]}| } }}| jz r&tjd| jz dt | |\} } } |D]~}t |}d} t | }t | }t |}t |}|D]W}| |||z } |D];}|D]2}d}d}d}|||dk(s|||dk(s|||dk(s| ||| ||| ||zk(r||||||z|||z }| ||| ||| ||zk(r||||||z|||z }| ||| ||| ||zk(r|||| ||z| ||z }|||d|z z|||<|||||||zz |||<||k7r|||xx||||zzcc<||k7s|||xx||||zzcc<5>||}}||}}Ztt|}}|sd}tjr$tjr2|d|z|z dz z}n#tjr|d|z|z dz z}|dk(r&|D]!}| |D]}||k7s ||vr|dz }|dz }#| |z} |rd||z ||z dz zz }| |z} njs| dz} |j| |r|S|dScc}}w) u{Compute the group betweenness centrality for a group of nodes. Group betweenness centrality of a group of nodes $C$ is the sum of the fraction of all-pairs shortest paths that pass through any vertex in $C$ .. 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|C)$ is the number of those paths passing through some node in group $C$. Note that $(s, t)$ are not members of the group ($V-C$ is the set of nodes in $V$ that are not in $C$). Parameters ---------- G : graph A NetworkX graph. C : list or set or list of lists or list of sets A group or a list of groups containing nodes which belong to G, for which group betweenness centrality is to be calculated. normalized : bool, optional (default=True) If True, group betweenness is normalized by `1/((|V|-|C|)(|V|-|C|-1))` where `|V|` is the number of nodes in G and `|C|` is the number of nodes in C. 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. The weight of an edge is treated as the length or distance between the two sides. endpoints : bool, optional (default=False) If True include the endpoints in the shortest path counts. Raises ------ NodeNotFound If node(s) in C are not present in G. Returns ------- betweenness : list of floats or float If C is a single group then return a float. If C is a list with several groups then return a list of group betweenness centralities. See Also -------- betweenness_centrality Notes ----- Group betweenness centrality is described in [1]_ and its importance discussed in [3]_. The initial implementation of the algorithm is mentioned in [2]_. This function uses an improved algorithm presented in [4]_. The number of nodes in the group must be a maximum of n - 2 where `n` is the total number of nodes in the graph. 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 between "u" and "v" are counted as two possible paths (one each direction) while undirected paths between "u" and "v" are counted as one path. Said another way, the sum in the expression above is over all ``s != t`` for directed graphs and for ``s < t`` for undirected graphs. References ---------- .. [1] M G Everett and S P Borgatti: The Centrality of Groups and Classes. Journal of Mathematical Sociology. 23(3): 181-201. 1999. http://www.analytictech.com/borgatti/group_centrality.htm .. [2] Ulrik Brandes: On Variants of Shortest-Path Betweenness Centrality and their Generic Computation. Social Networks 30(2):136-145, 2008. http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.72.9610&rep=rep1&type=pdf .. [3] Sourav Medya et. al.: Group Centrality Maximization via Network Design. SIAM International Conference on Data Mining, SDM 2018, 126–134. https://sites.cs.ucsb.edu/~arlei/pubs/sdm18.pdf .. [4] Rami Puzis, Yuval Elovici, and Shlomi Dolev. "Fast algorithm for successive computation of group betweenness centrality." https://journals.aps.org/pre/pdf/10.1103/PhysRevE.76.056709 Tc3&K|]}|v ywN).0elGs i/home/mcse/projects/flask/flask-venv/lib/python3.12/site-packages/networkx/algorithms/centrality/group.py z/group_betweenness_centrality..xs r27 sF The node(s)  are in C but not in G.r) anynodesnx NodeNotFound_group_preprocessingsetrlen is_directedis_strongly_connected is_connectedappend)rC normalizedr endpointsGBClist_of_groupsgroupnodeset_vPBsigmaD GBC_groupsigma_mPB_m sigma_m_vPB_m_vvxydxvydxyvdvxycscale group_node1s` rrrs| CN Q  C 3eU 3TT 3T 3E 3 qwwoo UQWW_,==TUVV(5&9LBq@E  5/|W% $ (A a #I ::ADDD 1 *gajmq.@GAJqMUVDVQ47ad1g!Q&77#*1:a=71:a=#@71:a=#PDQ47ad1g!Q&77#*1:a=71:a=#@71:a=#PDQ47ad1g!Q&77#*1:a=58A;#>q!#LD&-ajmq4x&@IaLO#'71:Q T0A#AF1IaLAvq ! Q T(99 Avq ! Q T(99 %: :("+GYG!4&D/ (41vs5z1E~~a ++A.QQ/E#QUQY]+z#(+K !++;.#u} %  %  ++  I !a%AEAI./E  I NI 9A@B q6MW 4sL c i}i}i}tj|d}|D]}|t||\}} ||<||<nt|||\}} ||<||<t ||| |||\}||<||D]+} || k7r||| xxdz cc<|||| dz ||| <-tj|} |D]} tj|d| | <|D]m} | || vr |D]^}| ||vs | ||vs||| ||| || | zk(s.| | | xx||| ||| z|| | z||| z z cc<`o| ||fS)Nrrrg)dictfromkeysrrr)rr/rr1deltar2 betweennesssSPir0r@ group_node2r.s rr!r!s E E A--1%K  . >#Ea#K Aq%(AaD#EaF#S Aq%(AaD 5k1aqST U U1Xq .AAva q !#AhqkAoa  . . q B --3/;  K!K.0 !D')kQtW.D$ ,T7;/!K.2MMN; 4!$K 4#Dk+67#K0=>$Dk+674  $ ua<c|ddl}ddl}|Yt|}||jz r&t j d||jz dt |j|z } nt |j} t j} d| _t|| |\} } } |jj| }|-|D](}|j|d|j|d*tt|j|| dDcgc]\}}| }}}d}g}| j!d ||dg| t#t| |j| d| jd d <t%|D]B}| jd d xx| jd d | jd d |z cc<Dt'||| |d | || | \}} }t)|}|sd}t j*|r$t j,|r2|d|z|z d z z}n#t j.|r|d|z|z d z z}|dk(r&|D]!}| |D]}||k7s ||vr|d z }|dz }#||z}|rd ||z ||z d z zz }||z}n|j+s|dz}t1|d}||fScc}}w)uaFind the prominent group of size $k$ in graph $G$. The prominence of the group is evaluated by the group betweenness centrality. Group betweenness centrality of a group of nodes $C$ is the sum of the fraction of all-pairs shortest paths that pass through any vertex in $C$ .. 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|C)$ is the number of those paths passing through some node in group $C$. Note that $(s, t)$ are not members of the group ($V-C$ is the set of nodes in $V$ that are not in $C$). Parameters ---------- G : graph A NetworkX graph. k : int The number of nodes in the group. normalized : bool, optional (default=True) If True, group betweenness is normalized by ``1/((|V|-|C|)(|V|-|C|-1))`` where ``|V|`` is the number of nodes in G and ``|C|`` is the number of nodes in C. 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. The weight of an edge is treated as the length or distance between the two sides. endpoints : bool, optional (default=False) If True include the endpoints in the shortest path counts. C : list or set, optional (default=None) list of nodes which won't be candidates of the prominent group. greedy : bool, optional (default=False) Using a naive greedy algorithm in order to find non-optimal prominent group. For scale free networks the results are negligibly below the optimal results. Raises ------ NodeNotFound If node(s) in C are not present in G. Returns ------- max_GBC : float The group betweenness centrality of the prominent group. max_group : list The list of nodes in the prominent group. See Also -------- betweenness_centrality, group_betweenness_centrality Notes ----- Group betweenness centrality is described in [1]_ and its importance discussed in [3]_. The algorithm is described in [2]_ and is based on techniques mentioned in [4]_. The number of nodes in the group must be a maximum of ``n - 2`` where ``n`` is the total number of nodes in the graph. 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 between "u" and "v" are counted as two possible paths (one each direction) while undirected paths between "u" and "v" are counted as one path. Said another way, the sum in the expression above is over all ``s != t`` for directed graphs and for ``s < t`` for undirected graphs. References ---------- .. [1] M G Everett and S P Borgatti: The Centrality of Groups and Classes. Journal of Mathematical Sociology. 23(3): 181-201. 1999. http://www.analytictech.com/borgatti/group_centrality.htm .. [2] Rami Puzis, Yuval Elovici, and Shlomi Dolev: "Finding the Most Prominent Group in Complex Networks" AI communications 20(4): 287-296, 2007. https://www.researchgate.net/profile/Rami_Puzis2/publication/220308855 .. [3] Sourav Medya et. al.: Group Centrality Maximization via Network Design. SIAM International Conference on Data Mining, SDM 2018, 126–134. https://sites.cs.ucsb.edu/~arlei/pubs/sdm18.pdf .. [4] Rami Puzis, Yuval Elovici, and Shlomi Dolev. "Fast algorithm for successive computation of group betweenness centrality." https://journals.aps.org/pre/pdf/10.1103/PhysRevE.76.056709 rNrrT)indexinplace)columnsrNreverser)CLrEr+GMr1contheurTrRrz.2f)numpypandasr"rrr listGraph__networkx_cache__r! DataFrame from_dictdropsortedzipdiagadd_noderBrange_dfbnbr#r$r%r&float)rkrr(r*r)greedynppdrDF_treer0r1r2rEr._rRmax_GBC max_grouprIr8r?r@s rr r sN} F qww;//LQWW =T"UV VQWWq[!QWW hhjG!%G'5&9LBq,,((,K} 9D   4  6   T4  8 9%S)=u%EtT U71d$ UB UGI    #eRWW[12 3 GMM!U 1XW a7==#3F#;GMM!>! ''*QUQY]+ __Q QQ'E A:( ' kN'D{*9,!QJE!QJE ' ' 5a!eA *+5]]_1 wsm%G I g Vs J8c rt|j|d|k(r:|j|d|kDr%|j|d||j|dfSt|j|d|k(sbt|j|d|t|j|dz ks(|j|d|j|dz|kr|||fSt||||||\} } }|rt||||| |||| \}}}n|j| d|j| dz|j| d|j| dzkDr/t||||| |||| \}}}t||||| |||| \}}}n.t||||| |||| \}}}t||||| |||| \}}}|||fS)NrSr+rRrU)r#r _heuristicrc) rrerirkrootr2rlrrfnode_pnode_ms rrcrcs 7== t $%*w}}T/B5/IG/S}}T"5)7GMM$4G4MMM GMM$  %&!+ w}}T"4( )QW]]45H5N1O-O O == u % d(;E(B Bg M**)D'1eVLFFG&, q'7FAy%' #)  fe$w}}V'u)E E F'- q'7FAy%' #)'- q'7FAy%' #)'- q'7FAy%' #)'- q'7FAy%' #) GY &&rKc ~ ddl}|jdz}|jdz}|j|dd} |j|t |j|fg|j|dj | |j|dxx|j|d| z cc<|j|} |D]} |D]} d} d}d}| d| | dk(s| d| | dk(s| d| | dk(s|| | || | || | zk(r#| d| | | d| | z| d| | z }|| | || | || | zk(r#| d| | | d| | z| d| | z } || | || | || | zk(r#| d| | | d| | z| d| | z }| d| | d| z z|j|d| | <| d | | | d | | | zz |j|d j | | f<| | k7r5|j|d j | | fxx| d | | |zzcc<| | k7s|j|d j | | fxx| d | | |zzcc<tt|j|j|d |d Dcgc]\}}||j|dvr|c}}|j|d<tt||j|j|d |j|d<d|j|d <t|t|j|dz D]B}|j|d xx|j|d|j|d|z cc<D|s|j|t |j|fg|j|djd|j|dj| d|j|d <t|t|j|dz D]B}|j|d xx|j|d|j|d|z cc<Dnd}|||fScc}}w) NrrrrRrSr+rTr1rETrPrU)rVnumber_of_nodesradd_nodes_fromrr'locr^r_r`rBrbr#pop)rerorir2rrfrgrprq added_node root_noder9r:r;r<r=rjr.rIs rrnrns $ $ & *F  $ $ & *Ft$T*1-J VXgmmD.A%BCDE MM&$&&z2 MM&% GMM&$9&$A*$MM  d#I '& ADDD'"1%a(A-W%a(49W%j1!49Q4 #qtAw1j1A'AA!'*1-a0#G,Q/ ;<#G,Q/ ;< Q47ad:.:q1AAA!'*1-j9#G,Z8;<#G,Q/23 Z=#q}Q'7!A$q''AA!'*:6q9#G,Q/23#G,Z8;< 4=W3Ea3H3KqSWx3XGMM& !' *1 -a 0-(+A.=1I!1LQ1ORV1VV MM& !- 0 4 4QT :J f%m488A>m,Q/ ;dB>J f%m488A>m,Z8;dB>I& 'V  f-m<=u Et # At w}}V,T2 2 #GMM&$%) E2777==0?@A%GMM&&!$%GMM&% 1s7==0677 8  fe$ f(=f(E MM& !$ ' *)  $  '--2E)F GHI fd#''* ff%))*5'( fe$q3w}}V4T:;;< A MM& !% (GMM&,A&,I f%d+A.-  (   67 ""=#s R9c:|jr|j}d}t|}t|}||z }tj|||}|D] } |||z }  t ||z }|S#t $r|dz }Y/wxYw#t$rd}Y|SwxYw)aB Compute the group closeness centrality for a group of nodes. Group closeness centrality of a group of nodes $S$ is a measure of how close the group is to the other nodes in the graph. .. math:: c_{close}(S) = \frac{|V-S|}{\sum_{v \in V-S} d_{S, v}} d_{S, v} = min_{u \in S} (d_{u, v}) where $V$ is the set of nodes, $d_{S, v}$ is the distance of the group $S$ from $v$ defined as above. ($V-S$ is the set of nodes in $V$ that are not in $S$). Parameters ---------- G : graph A NetworkX graph. S : list or set S is a group of nodes which belong to G, for which group closeness centrality is to be calculated. 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. The weight of an edge is treated as the length or distance between the two sides. Raises ------ NodeNotFound If node(s) in S are not present in G. Returns ------- closeness : float Group closeness centrality of the group S. See Also -------- closeness_centrality Notes ----- The measure was introduced in [1]_. The formula implemented here is described in [2]_. Higher values of closeness indicate greater centrality. It is assumed that 1 / 0 is 0 (required in the case of directed graphs, or when a shortest path length is 0). The number of nodes in the group must be a maximum of n - 1 where `n` is the total number of nodes in the graph. For directed graphs, the incoming distance is utilized here. To use the outward distance, act on `G.reverse()`. 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] M G Everett and S P Borgatti: The Centrality of Groups and Classes. Journal of Mathematical Sociology. 23(3): 181-201. 1999. http://www.analytictech.com/borgatti/group_centrality.htm .. [2] J. Zhao et. al.: Measuring and Maximizing Group Closeness Centrality over Disk Resident Graphs. WWWConference Proceedings, 2014. 689-694. https://doi.org/10.1145/2567948.2579356 r)r)r$rQr"r!multi_source_dijkstra_path_lengthKeyErrorr#ZeroDivisionError)rrGr closenessVV_Sshortest_path_lengthsr8s rr r $sZ }} IIKI AA AA a%C@@AfU   .q1 1I Hy(     NI   s$A7'B 7BB BBc ttj|Dcgc]}t|j|c}t|z }|t|j t|z z}|Scc}w)aKCompute the group degree centrality for a group of nodes. Group degree centrality of a group of nodes $S$ is the fraction of non-group members connected to group members. Parameters ---------- G : graph A NetworkX graph. S : list or set S is a group of nodes which belong to G, for which group degree centrality is to be calculated. Raises ------ NetworkXError If node(s) in S are not in G. Returns ------- centrality : float Group degree centrality of the group S. See Also -------- degree_centrality group_in_degree_centrality group_out_degree_centrality Notes ----- The measure was introduced in [1]_. The number of nodes in the group must be a maximum of n - 1 where `n` is the total number of nodes in the graph. References ---------- .. [1] M G Everett and S P Borgatti: The Centrality of Groups and Classes. Journal of Mathematical Sociology. 23(3): 181-201. 1999. http://www.analytictech.com/borgatti/group_centrality.htm )r#r"union neighborsr)rrGrI centralitys rr r sf\[SU[["B13q{{1~#6"BCc!fLMJ#aggi.3q6))J #Cs!A= undirectedc6t|j|S)a Compute the group in-degree centrality for a group of nodes. Group in-degree centrality of a group of nodes $S$ is the fraction of non-group members connected to group members by incoming edges. Parameters ---------- G : graph A NetworkX graph. S : list or set S is a group of nodes which belong to G, for which group in-degree centrality is to be calculated. Returns ------- centrality : float Group in-degree centrality of the group S. Raises ------ NetworkXNotImplemented If G is undirected. NodeNotFound If node(s) in S are not in G. See Also -------- degree_centrality group_degree_centrality group_out_degree_centrality Notes ----- The number of nodes in the group must be a maximum of n - 1 where `n` is the total number of nodes in the graph. `G.neighbors(i)` gives nodes with an outward edge from i, in a DiGraph, so for group in-degree centrality, the reverse graph is used. )r rQrrGs rr r sX #199; 22rKct||S)aCompute the group out-degree centrality for a group of nodes. Group out-degree centrality of a group of nodes $S$ is the fraction of non-group members connected to group members by outgoing edges. Parameters ---------- G : graph A NetworkX graph. S : list or set S is a group of nodes which belong to G, for which group in-degree centrality is to be calculated. Returns ------- centrality : float Group out-degree centrality of the group S. Raises ------ NetworkXNotImplemented If G is undirected. NodeNotFound If node(s) in S are not in G. See Also -------- degree_centrality group_degree_centrality group_in_degree_centrality Notes ----- The number of nodes in the group must be a maximum of n - 1 where `n` is the total number of nodes in the graph. `G.neighbors(i)` gives nodes with an outward edge from i, in a DiGraph, so for group out-degree centrality, the graph itself is used. )r rs rr r sX #1a ((rK)TNF)NNFTFr)__doc__copyrnetworkxr*networkx.algorithms.centrality.betweennessrrrnetworkx.utils.decoratorsr__all__ _dispatchablerr!r rcrnr r r r rrKrrs  : X&n'nb$NX&HMl'l^)'XU#pX&]']@//d\"*3#*3Z\"*)#*)rK