Warning

This documents an unmaintained version of NetworkX. Please upgrade to a maintained version and see the current NetworkX documentation.

# uniform_random_intersection_graph¶

uniform_random_intersection_graph(n, m, p, seed=None)[source]

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 (int, optional) – Seed for random number generator (default=None).

gnp_random_graph()