5.16.3. networkx.generators.community.relaxed_caveman_graph¶

networkx.generators.community.relaxed_caveman_graph(l, k, p, seed=None)[source]¶

Return a relaxed caveman graph.

A relaxed caveman graph starts with l cliques of size k. Edges are then randomly rewired with probability p to link different cliques.

Parameters:	l : int Number of groups k : int Size of cliques p : float Probabilty of rewiring each edge. seed : int,optional Seed for random number generator(default=None)
Returns:	G : NetworkX Graph Relaxed Caveman Graph
Raises:	NetworkXError: If p is not in [0,1]

References

[R1004]

Santo Fortunato, Community Detection in Graphs, Physics Reports Volume 486, Issues 3-5, February 2010, Pages 75-174. http://arxiv.org/abs/0906.0612

Examples

>>> G = nx.relaxed_caveman_graph(2, 3, 0.1, seed=42)