5.16.2. networkx.generators.community.connected_caveman_graph¶

networkx.generators.community.connected_caveman_graph(l, k)[source]¶

Returns a connected caveman graph of l cliques of size k.

The connected caveman graph is formed by creating n cliques of size k, then a single edge in each clique is rewired to a node in an adjacent clique.

Parameters:	l : int number of cliques k : int size of cliques
Returns:	G : NetworkX Graph connected caveman graph

Notes

This returns an undirected graph, it can be converted to a directed graph using nx.to_directed(), or a multigraph using nx.MultiGraph(nx.caveman_graph(l, k)). Only the undirected version is described in [R999] and it is unclear which of the directed generalizations is most useful.

References

[R999]

(1, 2) Watts, D. J. ‘Networks, Dynamics, and the Small-World Phenomenon.’ Amer. J. Soc. 105, 493-527, 1999.

Examples

>>> G = nx.connected_caveman_graph(3, 3)