ó |£*^c@s¨dZdZddddgZddlZddlZddlmZdd lm Z dddd „Z ddd „Z ddd „Z d ddddddd„ZdS(sd Generators for some directed graphs, including growing network (GN) graphs and scale-free graphs. sKAric Hagberg (hagberg@lanl.gov) Willem Ligtenberg (W.P.A.Ligtenberg@tue.nl)tgn_grapht gnc_grapht gnr_graphtscale_free_graphiÿÿÿÿN(t empty_graph(tdiscrete_sequencec Cs5|dkrtjƒ}n|jƒs9tjdƒ‚n|dkrQd„}n|dk rmtj|ƒntd|ƒ}d||_|dkr™|S|j ddƒddg}xyt d|ƒD]h}g|D]}||ƒ^qÒ}t dd|ƒd} |j || ƒ|j dƒ|| cd7>> D = nx.gn_graph(10) # the GN graph >>> G = D.to_undirected() # the undirected version To specify an attachment kernel, use the ``kernel`` keyword argument:: >>> D = nx.gn_graph(10, kernel=lambda x: x ** 1.5) # A_k = k^1.5 References ---------- .. [1] P. L. Krapivsky and S. Redner, Organization of Growing Random Networks, Phys. Rev. E, 63, 066123, 2001. s'Directed Graph required in create_usingcSs|S(N((tx((sp/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/generators/directed.pytEsis gn_graph(%s)iit distributionN( tNonetnxtDiGrapht is_directedt NetworkXErrortrandomtseedRtnametadd_edgetrangeRtappend( tntkernelt create_usingRtGtdstsourcetdtdistttarget((sp/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/generators/directed.pyRs*'         cCsû|dkrtjƒ}n|jƒs9tjdƒ‚n|dk rUtj|ƒntd|ƒ}d||f|_|dkr‡|Sxmt d|ƒD]\}tj d|ƒ}tjƒ|krã|dkrã|j |ƒd}n|j ||ƒq—W|S(s‘Return the growing network with redirection (GNR) digraph with ``n`` nodes and redirection probability ``p``. The GNR graph is built by adding nodes one at a time with a link to one previously added node. The previous target node is chosen uniformly at random. With probabiliy ``p`` the link is instead "redirected" to the successor node of the target. The graph is always a (directed) tree. Parameters ---------- n : int The number of nodes for the generated graph. p : float The redirection probability. create_using : graph, optional (default DiGraph) Return graph of this type. The instance will be cleared. seed : hashable object, optional The seed for the random number generator. Examples -------- To create the undirected GNR graph, use the :meth:`~DiGraph.to_directed` method:: >>> D = nx.gnr_graph(10, 0.5) # the GNR graph >>> G = D.to_undirected() # the undirected version References ---------- .. [1] P. L. Krapivsky and S. Redner, Organization of Growing Random Networks, Phys. Rev. E, 63, 066123, 2001. s'Directed Graph required in create_usingisgnr_graph(%s,%s)iN( R R R R R RRRRRt randranget successorsR(RtpRRRRR((sp/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/generators/directed.pyR^s $    cCsë|dkrtjƒ}n|jƒs9tjdƒ‚n|dk rUtj|ƒntd|ƒ}d||_|dkr|Sxct d|ƒD]R}tj d|ƒ}x'|j |ƒD]}|j ||ƒq¹W|j ||ƒq‘W|S(sÄReturn the growing network with copying (GNC) digraph with ``n`` nodes. The GNC graph is built by adding nodes one at a time with a link to one previously added node (chosen uniformly at random) and to all of that node's successors. Parameters ---------- n : int The number of nodes for the generated graph. create_using : graph, optional (default DiGraph) Return graph of this type. The instance will be cleared. seed : hashable object, optional The seed for the random number generator. References ---------- .. [1] P. L. Krapivsky and S. Redner, Network Growth by Copying, Phys. Rev. E, 71, 036118, 2005k.}, s'Directed Graph required in create_usingis gnc_graph(%s)iN( R R R R R RRRRRRRR(RRRRRRtsucc((sp/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/generators/directed.pyR™s      g= ×£p=Ú?gHáz®Gá?gš™™™™™©?gš™™™™™É?ic CsÝd„}|d kr:tjƒ} | jd d dgƒn0|} | jƒoU| jƒsjtjdƒ‚n|dkr…tdƒ‚n|dkr tdƒ‚n|dkr»tdƒ‚n|||dkrÞtd ƒ‚nd ||||||f| _t j |ƒxÌt | ƒ|krØt j ƒ} | |kr^t | ƒ} || | j ƒ|ƒ} ng| ||kr¡|| | j ƒ|ƒ} || | j ƒ|ƒ} n$|| | j ƒ|ƒ} t | ƒ} | j| | ƒq W| S(sêReturns a scale-free directed graph. Parameters ---------- n : integer Number of nodes in graph alpha : float Probability for adding a new node connected to an existing node chosen randomly according to the in-degree distribution. beta : float Probability for adding an edge between two existing nodes. One existing node is chosen randomly according the in-degree distribution and the other chosen randomly according to the out-degree distribution. gamma : float Probability for adding a new node conecgted to an existing node chosen randomly according to the out-degree distribution. delta_in : float Bias for choosing ndoes from in-degree distribution. delta_out : float Bias for choosing ndoes from out-degree distribution. create_using : graph, optional (default MultiDiGraph) Use this graph instance to start the process (default=3-cycle). seed : integer, optional Seed for random number generator Examples -------- Create a scale-free graph on one hundred nodes:: >>> G = nx.scale_free_graph(100) Notes ----- The sum of ``alpha``, ``beta``, and ``gamma`` must be 1. References ---------- .. [1] B. Bollobás, C. Borgs, J. Chayes, and O. Riordan, Directed scale-free graphs, Proceedings of the fourteenth annual ACM-SIAM Symposium on Discrete Algorithms, 132--139, 2003. cSsˆd}tt|jƒƒƒt|ƒt|ƒ}tjƒ}xCtdt|ƒƒD],}|||||7}||krTPqTqTW|S(Ngi(tfloattsumtvaluestlenRR(RRtdeltatcumsumtpsumtrti((sp/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/generators/directed.pyt _choose_nodeôs,  iiis%MultiDiGraph required in create_usingsalpha must be >= 0.sbeta must be >= 0.gð?salpha+beta+gamma must equal 1.sPdirected_scale_free_graph(%s,alpha=%s,beta=%s,gamma=%s,delta_in=%s,delta_out=%s)N(ii(ii(ii(R R t MultiDiGraphtadd_edges_fromR t is_multigraphR t ValueErrorRRRR$t in_degreet out_degreeR( Rtalphatbetatgammatdelta_int delta_outRRR*RR(tvtw((sp/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/generators/directed.pyRÆs<.           (t__doc__t __author__t__all__RtnetworkxR tnetworkx.generators.classicRtnetworkx.utilsRR RRRR(((sp/home/gitlab-runner/builds/8480fa44/0/bergerc/fluidmanager-web/art-framework/bin/networkx/generators/directed.pyts  F;-