- connected_caveman_graph(l, k)[source]#
Returns a connected caveman graph of
lcliques of size
The connected caveman graph is formed by creating
ncliques of size
k, then a single edge in each clique is rewired to a node in an adjacent clique.
number of cliques
size of cliques (k at least 2 or NetworkXError is raised)
- GNetworkX Graph
connected caveman graph
If the size of cliques
kis smaller than 2.
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  and it is unclear which of the directed generalizations is most useful.
Watts, D. J. ‘Networks, Dynamics, and the Small-World Phenomenon.’ Amer. J. Soc. 105, 493-527, 1999.
>>> G = nx.connected_caveman_graph(3, 3)