ó ,µ[c@s«dZddlZddlZddlmZddlmZdjdgƒZ ddd gZ ed ƒdd „ƒZ ed ƒdd „ƒZ ed ƒdd „ƒZdS(s, Generators for random intersection graphs. iÿÿÿÿN(t bipartite(tpy_random_states sAric Hagberg (hagberg@lanl.gov)t!uniform_random_intersection_graphtk_random_intersection_grapht!general_random_intersection_graphicCs.tj||||ƒ}tj|t|ƒƒS(s’Return a uniform random intersection graph. Parameters ---------- n : int The number of nodes in the first bipartite set (nodes) m : int The number of nodes in the second bipartite set (attributes) p : float Probability of connecting nodes between bipartite sets seed : integer, random_state, or None (default) Indicator of random number generation state. See :ref:`Randomness`. See Also -------- gnp_random_graph References ---------- .. [1] K.B. Singer-Cohen, Random Intersection Graphs, 1995, PhD thesis, Johns Hopkins University .. [2] Fill, J. A., Scheinerman, E. R., and Singer-Cohen, K. B., Random intersection graphs when m = !(n): An equivalence theorem relating the evolution of the g(n, m, p) and g(n, p) models. Random Struct. Algorithms 16, 2 (2000), 156–176. (Rt random_graphtnxtprojected_graphtrange(tntmtptseedtG((s?lib/python2.7/site-packages/networkx/generators/intersection.pyRscCsˆtj||ƒ}t|||ƒ}xIt|ƒD];}|j||ƒ}|jt|gt|ƒ|ƒƒq3Wtj|t|ƒƒS(s/Return a intersection graph with randomly chosen attribute sets for each node that are of equal size (k). Parameters ---------- n : int The number of nodes in the first bipartite set (nodes) m : int The number of nodes in the second bipartite set (attributes) k : float Size of attribute set to assign to each node. seed : integer, random_state, or None (default) Indicator of random number generation state. See :ref:`Randomness`. See Also -------- gnp_random_graph, uniform_random_intersection_graph References ---------- .. [1] Godehardt, E., and Jaworski, J. Two models of random intersection graphs and their applications. Electronic Notes in Discrete Mathematics 10 (2001), 129--132. (Rt empty_graphRtsampletadd_edges_fromtziptlenR(R R tkR R tmsettvttargets((s?lib/python2.7/site-packages/networkx/generators/intersection.pyR9s 'c Cs¹t|ƒ|kr!tdƒ‚ntj||ƒ}t|||ƒ}xYt|ƒD]K}xBt||ƒD]1\}}|jƒ|krj|j||ƒqjqjWqTWtj|t|ƒƒS(sReturn a random intersection graph with independent probabilities for connections between node and attribute sets. Parameters ---------- n : int The number of nodes in the first bipartite set (nodes) m : int The number of nodes in the second bipartite set (attributes) p : list of floats of length m Probabilities for connecting nodes to each attribute seed : integer, random_state, or None (default) Indicator of random number generation state. See :ref:`Randomness`. See Also -------- gnp_random_graph, uniform_random_intersection_graph References ---------- .. [1] Nikoletseas, S. E., Raptopoulos, C., and Spirakis, P. G. The existence and efficient construction of large independent sets in general random intersection graphs. In ICALP (2004), J. D´ıaz, J. Karhum¨aki, A. Lepist¨o, and D. Sannella, Eds., vol. 3142 of Lecture Notes in Computer Science, Springer, pp. 1029–1040. s(Probability list p must have m elements.( Rt ValueErrorRRRRtrandomtadd_edgeR( R R R R R RtuRtq((s?lib/python2.7/site-packages/networkx/generators/intersection.pyR\s(t__doc__RtnetworkxRtnetworkx.algorithmsRtnetworkx.utilsRtjoint __author__t__all__tNoneRRR(((s?lib/python2.7/site-packages/networkx/generators/intersection.pyts     "