hCfSrSSKrSSKJr SSKJr S/r\R"SSS9S S j5r S r g) z Percolation centrality measures.N)"_single_source_dijkstra_path_basic)"_single_source_shortest_path_basicpercolation_centrality attributeweight) node_attrs edge_attrsc \[RUS5nUnUc[R"XQSS9nSnUR 5HnXg- nM UH2nUc[ X5uppO[ XU5upp[XIXXU5nM4 [U5n UHnXG==SU S- - -ss'M U$)u Compute the percolation centrality for nodes. Percolation centrality of a node $v$, at a given time, is defined as the proportion of ‘percolated paths’ that go through that node. This measure quantifies relative impact of nodes based on their topological connectivity, as well as their percolation states. Percolation states of nodes are used to depict network percolation scenarios (such as during infection transmission in a social network of individuals, spreading of computer viruses on computer networks, or transmission of disease over a network of towns) over time. In this measure usually the percolation state is expressed as a decimal between 0.0 and 1.0. When all nodes are in the same percolated state this measure is equivalent to betweenness centrality. Parameters ---------- G : graph A NetworkX graph. attribute : None or string, optional (default='percolation') Name of the node attribute to use for percolation state, used if `states` is None. If a node does not set the attribute the state of that node will be set to the default value of 1. If all nodes do not have the attribute all nodes will be set to 1 and the centrality measure will be equivalent to betweenness centrality. states : None or dict, optional (default=None) Specify percolation states for the nodes, nodes as keys states as values. 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. Returns ------- nodes : dictionary Dictionary of nodes with percolation centrality as the value. See Also -------- betweenness_centrality Notes ----- The algorithm is from Mahendra Piraveenan, Mikhail Prokopenko, and Liaquat Hossain [1]_ Pair dependencies are calculated and accumulated using [2]_ 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] Mahendra Piraveenan, Mikhail Prokopenko, Liaquat Hossain Percolation Centrality: Quantifying Graph-Theoretic Impact of Nodes during Percolation in Networks http://journals.plos.org/plosone/article?id=10.1371/journal.pone.0053095 .. [2] 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 g)default) dictfromkeysnxget_node_attributesvalues shortest_pathdijkstra_accumulate_percolationlen)Grstatesr percolationnodes p_sigma_x_tvsSPsigma_ns \/var/www/html/env/lib/python3.13/site-packages/networkx/algorithms/centrality/percolation.pyrrsP--3'K E ~''!DK ]]_  >*10NA%%aF3NA%- Aa  AA !q1u+% c[RUS5nU(acUR5nSXx-X8- n X(Hn Xz==X:U -- ss'M X:waXTXeU- - n X==XxU -- ss'U(aMcU$)Nrr )rrpop) rrrr rrrdeltawcoeffrpw_s_ws r#rrus MM!Q E EEGUX)A H5( (H 6Y+q "9:F Neh/ /N ! r$)rNN) __doc__networkxr*networkx.algorithms.centrality.betweennessrrrr__all__ _dispatchablerrr$r#r1sH& $ $[X>c?cL r$