+ jRt^RIt^RIHt.ROt]!^4]P !RRR7R Rl44t]!^4]P !RRR7R Rl44t]!^4]P !RRR7R Rl44t R#) z, Generators for random intersection graphs. N)py_random_stateT)graphs returns_graphcr^RIHpVPWW#4p\P!V\ V44#)u7Returns 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. ) bipartite)networkx.algorithmsr random_graphnxprojected_graphrange)nmpseedrGs&&&& a/home/luca/screen-checking/.venv/lib/python3.14/site-packages/networkx/generators/intersection.py!uniform_random_intersection_graphrs0<.qQ-A  aq **c <\P!W,4p\WV,4p\V4F@pVPWR4pVP \ V.\ V4,V44KB \P!V\V44#)aReturns 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. )r empty_graphr sampleadd_edges_fromziplenr )r r krrmsetvtargetss&&&& rk_random_intersection_graphr3sv8 quA E?D 1X++d& aS3w</9:   aq **rcp\V4V8wd \R4h\P!W,4p\ WV,4p\ V4F?p\ WR4F-wrxVP 4V8gKVPWg4K/ KA \P!V\ V44#)uReturns 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. z(Probability list p must have m elements.) r ValueErrorr rr rrandomadd_edger ) r r rrrrurqs &&&& r!general_random_intersection_graphr%Ws< 1v{CDD quA E?D 1XLDA{{}q  1 !   aq **r)rrr%)N) __doc__networkxr networkx.utilsr__all__ _dispatchablerrr%rrr,s* T2+3+DT2+3+DT2$+3$+r