~i >SrSSKrS/r\RSSj5rg)z@Algorithm to select influential nodes in a graph using VoteRank.Nvoterankc^/n0m[U5S:XaU$UbU[U5:a [U5nUR5(a-[SUR555[U5- nO,[SUR 555[U5- nUR 5H nSS/TU'M [ U5GHnUR 5H nSTUS'M UR5HHupFTUS==TUS- ss'UR5(aM2TUS==TUS- ss'MJ UH nSTUS'M [UR U4SjS9nTUSS:XaUs $URU5 SS/TU'URU5H0upVTUS==SU- -ss'[TUSS5TUS'M2 GM U$)a#Select a list of influential nodes in a graph using VoteRank algorithm VoteRank [1]_ computes a ranking of the nodes in a graph G based on a voting scheme. With VoteRank, all nodes vote for each of its in-neighbors and the node with the highest votes is elected iteratively. The voting ability of out-neighbors of elected nodes is decreased in subsequent turns. Parameters ---------- G : graph A NetworkX graph. number_of_nodes : integer, optional Number of ranked nodes to extract (default all nodes). Returns ------- voterank : list Ordered list of computed seeds. Only nodes with positive number of votes are returned. Examples -------- >>> G = nx.Graph([(0, 1), (0, 2), (0, 3), (1, 4)]) >>> nx.voterank(G) [0, 1] The algorithm can be used both for undirected and directed graphs. However, the directed version is different in two ways: (i) nodes only vote for their in-neighbors and (ii) only the voting ability of elected node and its out-neighbors are updated: >>> G = nx.DiGraph([(0, 1), (2, 1), (2, 3), (3, 4)]) >>> nx.voterank(G) [2, 3] Notes ----- Each edge is treated independently in case of multigraphs. References ---------- .. [1] Zhang, J.-X. et al. (2016). Identifying a set of influential spreaders in complex networks. Sci. Rep. 6, 27823; doi: 10.1038/srep27823. rc3*# UH upUv M g7fN.0_degs h/home/mande/repo/quber/.venv/lib/python3.13/site-packages/networkx/algorithms/centrality/voterank_alg.py voterank..@s9..c3*# UH upUv M g7frrrs r r rCs5**rc>TUS$)Nrr)x vote_ranks r voterank..Us y|A)key) len is_directedsum out_degreedegreenodesrangeedgesmaxappend)Gnumber_of_nodesinfluential_nodes avgDegreenr nbrrs @r rrs`I 1v{  /CF":a&}}9!,,.99CFB 5!((*55A> WWY1v ! ? #AIaLOggiFA aLOy~a0 0O==??#q!Yq\!_4!  #AIaLO# 6 7 Q<?a $ $  #1v ! ggajFA cN1 Y .  #IcN1$5q 9IcN1 !)$. rr)__doc__networkxnx__all__ _dispatchablerrrr r.s.F ,VVr