o 3ήc@s6ddlmZddlZddgZ dddZdddZdS) ) defaultdictNaverage_degree_connectivityk_nearest_neighborsin+outcs~r9|dvr td|dvrtdjjjd}jjjd}||}||}||} |dk} n|dksA|dkrFtdj}j}j} d} t t } t t ||} |vrh|||fg} | D]I\} || }d urt d d |D}n| rt fd d |D}n t fd d |D}| |d7<| | |7<qjfdd| DS)uCompute the average degree connectivity of graph. The average degree connectivity is the average nearest neighbor degree of nodes with degree k. For weighted graphs, an analogous measure can be computed using the weighted average neighbors degree defined in [1]_, for a node `i`, as .. math:: k_{nn,i}^{w} = \frac{1}{s_i} \sum_{j \in N(i)} w_{ij} k_j where `s_i` is the weighted degree of node `i`, `w_{ij}` is the weight of the edge that links `i` and `j`, and `N(i)` are the neighbors of node `i`. Parameters ---------- G : NetworkX graph source : "in"|"out"|"in+out" (default:"in+out") Directed graphs only. Use "in"- or "out"-degree for source node. target : "in"|"out"|"in+out" (default:"in+out" Directed graphs only. Use "in"- or "out"-degree for target node. nodes : list or iterable (optional) Compute neighbor connectivity for these nodes. The default is all nodes. weight : string or None, optional (default=None) The edge attribute that holds the numerical value used as a weight. If None, then each edge has weight 1. Returns ------- d : dict A dictionary keyed by degree k with the value of average connectivity. Raises ------ NetworkXError If either `source` or `target` are not one of 'in', 'out', or 'in+out'. If either `source` or `target` is passed for an undirected graph. Examples -------- >>> G = nx.path_graph(4) >>> G.edges[1, 2]["weight"] = 3 >>> nx.average_degree_connectivity(G) {1: 2.0, 2: 1.5} >>> nx.average_degree_connectivity(G, weight="weight") {1: 2.0, 2: 1.75} See Also -------- average_neighbor_degree References ---------- .. [1] A. Barrat, M. Barthélemy, R. Pastor-Satorras, and A. Vespignani, "The architecture of complex weighted networks". PNAS 101 (11): 3747–3752 (2004). )inoutrz.source must be one of "in", "out", or "in+out"z.target must be one of "in", "out", or "in+out")rrrrrzBsource and target arguments are only supported for directed graphsFNcss|]\}}|VqdS)N).0ndrrU/tmp/pip-target-vg8gfxp4/lib/python/networkx/algorithms/assortativity/connectivity.py osz.average_degree_connectivity..c3s,|]\}}|d|VqdSNgetr nbrr Gr weightrr r r*c3s,|]\}}|d|VqdSrrrrrr r tr)rcs.i|]\}}||dkr|n||qS)rr)r kavg)dnormrr ys.z/average_degree_connectivity..) is_directednx NetworkXError out_degree in_degreedegree successors predecessors neighborsrintsumitems)rsourcetargetnodesr directionneighbor_funcs source_degree target_degreer$reversedsum source_nodesrnbrdegsr)rrr rr rsJD     cCs,ddl}d}|j|tddt|||||S)zCompute the average degree connectivity of graph. .. deprecated 2.6 k_nearest_neighbors function is deprecated and will be removed in v3.0. Use `average_degree_connectivity` instead. rNzrk_nearest_neighbors function is deprecated and will be removed in v3.0. Use `average_degree_connectivity` instead.) stacklevel)warningswarnDeprecationWarningr)rr(r)r*rr6msgrrr r|s )rrNN) collectionsrnetworkxr__all__rrrrrr s  t