ó |£*^c@sFddlZdjddgƒZdgZedd„Zd„ZdS( iÿÿÿÿNs s Ben EdwardssAric Hagberg trich_club_coefficientidcCsØ|jƒs|jƒr*tddƒ‚nt|jƒƒdkrTtddƒ‚nt|ƒ}|rÔ|jƒ}|jƒ}tj |||d||dƒt|ƒ}x%|D]}||c||:>> G = nx.Graph([(0,1),(0,2),(1,2),(1,3),(1,4),(4,5)]) >>> rc = nx.rich_club_coefficient(G,normalized=False) >>> rc[0] # doctest: +SKIP 0.4 Notes ----- The rich club definition and algorithm are found in [1]_. This algorithm ignores any edge weights and is not defined for directed graphs or graphs with parallel edges or self loops. Estimates for appropriate values of Q are found in [2]_. References ---------- .. [1] Julian J. McAuley, Luciano da Fontoura Costa, and Tibério S. Caetano, "The rich-club phenomenon across complex network hierarchies", Applied Physics Letters Vol 91 Issue 8, August 2007. http://arxiv.org/abs/physics/0701290 .. [2] R. Milo, N. Kashtan, S. Itzkovitz, M. E. J. Newman, U. Alon, "Uniform generation of random graphs with arbitrary degree sequences", 2006. http://arxiv.org/abs/cond-mat/0312028 s-rich_club_coefficient is not implemented for sdirected or multiedge graphs.isgraphs with self loops.t max_triesi ( t is_multigrapht is_directedt Exceptiontlentselfloop_edgest _compute_rctcopytnumber_of_edgestnxtdouble_edge_swap(tGt normalizedtQtrctRtEtrcrantd((sp/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/richclub.pyRs6     "  c s;tj|ƒ}t|ƒ}gtjj|ƒD] }||dkr.||^q.}|jƒ‰t‡fd†|jƒDƒƒ}|jƒ}|j dƒ\}}i} x‹t t t |ƒƒ|ƒD]n\} } xE|| krt |ƒdkröPn|j dƒ\}}|d8}qÔWd|| | d| | Ysig@( R tdegree_histogramtsumtutilst accumulatetdegreeRt edges_iterR tpoptziptrangeR( R tdeghistttotaltcstnkst edge_degreestektk1tk2RRtnk((Rsp/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/richclub.pyRRs  9 " ((tnetworkxR tjoint __author__t__all__tTrueRR(((sp/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/algorithms/richclub.pyts    J