o ßË·e§ ã@sDdZddlmZgd¢Zdd„Zedƒdd„ƒZedƒd d „ƒZd S) zDegree centrality measures.é)Únot_implemented_for)Údegree_centralityÚin_degree_centralityÚout_degree_centralitycóDt|ƒdkr dd„|DƒSdt|ƒd‰‡fdd„| ¡Dƒ}|S)aèCompute the degree centrality for nodes. The degree centrality for a node v is the fraction of nodes it is connected to. Parameters ---------- G : graph A networkx graph Returns ------- nodes : dictionary Dictionary of nodes with degree centrality as the value. See Also -------- betweenness_centrality, load_centrality, eigenvector_centrality Notes ----- The degree centrality values are normalized by dividing by the maximum possible degree in a simple graph n-1 where n is the number of nodes in G. For multigraphs or graphs with self loops the maximum degree might be higher than n-1 and values of degree centrality greater than 1 are possible. écSói|]}|d“qS©r©©Ú.0Únr r ú`/var/www/ideatree/venv/lib/python3.10/site-packages/networkx/algorithms/centrality/degree_alg.pyÚ %óz%degree_centrality..çð?cói|] \}}||ˆ“qSr r ©r r Úd©Úsr rr(ó)ÚlenÚdegree©ÚGÚ centralityr rrrs rÚ undirectedcr)a9Compute the in-degree centrality for nodes. The in-degree centrality for a node v is the fraction of nodes its incoming edges are connected to. Parameters ---------- G : graph A NetworkX graph Returns ------- nodes : dictionary Dictionary of nodes with in-degree centrality as values. Raises ------ NetworkXNotImplemented If G is undirected. See Also -------- degree_centrality, out_degree_centrality Notes ----- The degree centrality values are normalized by dividing by the maximum possible degree in a simple graph n-1 where n is the number of nodes in G. For multigraphs or graphs with self loops the maximum degree might be higher than n-1 and values of degree centrality greater than 1 are possible. rcSrr r r r r rrPrz(in_degree_centrality..rcrr r rrr rrSr)rÚ in_degreerr rrr,ó #rcr)a;Compute the out-degree centrality for nodes. The out-degree centrality for a node v is the fraction of nodes its outgoing edges are connected to. Parameters ---------- G : graph A NetworkX graph Returns ------- nodes : dictionary Dictionary of nodes with out-degree centrality as values. Raises ------ NetworkXNotImplemented If G is undirected. See Also -------- degree_centrality, in_degree_centrality Notes ----- The degree centrality values are normalized by dividing by the maximum possible degree in a simple graph n-1 where n is the number of nodes in G. For multigraphs or graphs with self loops the maximum degree might be higher than n-1 and values of degree centrality greater than 1 are possible. rcSrr r r r r rr{rz)out_degree_centrality..rcrr r rrr rr~r)rÚ out_degreerr rrrWrrN)Ú__doc__Únetworkx.utils.decoratorsrÚ__all__rrrr r r rÚs % *