ó ú£Õ\c@sXdZdjdddgƒZdddgZdd lZd „Zd „Zd „Zd S( s Degree centrality measures. s sAric Hagberg (hagberg@lanl.gov)sPieter Swart (swart@lanl.gov)s#Sasha Gutfraind (ag362@cornell.edu)tdegree_centralitytin_degree_centralitytout_degree_centralityiÿÿÿÿNcs@i}dt|ƒd‰t‡fd†|jƒDƒƒ}|S(sê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. gð?c3s%|]\}}||ˆfVqdS(N((t.0tntd(ts(sa/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/algorithms/centrality/degree_alg.pys 4s(tlentdictt degree_iter(tGt centrality((Rsa/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/algorithms/centrality/degree_alg.pyRs"cs^|jƒstjdƒ‚ni}dt|ƒd‰t‡fd†|jƒDƒƒ}|S(síCompute 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. 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. s9in_degree_centrality() not defined for undirected graphs.gð?c3s%|]\}}||ˆfVqdS(N((RRR(R(sa/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/algorithms/centrality/degree_alg.pys Ys(t is_directedtnxt NetworkXErrorRRtin_degree_iter(R R ((Rsa/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/algorithms/centrality/degree_alg.pyR7s  "cs^|jƒstjdƒ‚ni}dt|ƒd‰t‡fd†|jƒDƒƒ}|S(sï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. 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. s:out_degree_centrality() not defined for undirected graphs.gð?c3s%|]\}}||ˆfVqdS(N((RRR(R(sa/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/algorithms/centrality/degree_alg.pys s(R R RRRtout_degree_iter(R R ((Rsa/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/algorithms/centrality/degree_alg.pyR]s  "( t__doc__tjoint __author__t__all__tnetworkxR RRR(((sa/Users/dxp/prism/prism-games/prism-examples/smgs/car/networkx/algorithms/centrality/degree_alg.pyts     " &