networkx 2.8.2 Pypi GitHub Homepage
Other Docs
NotesParametersRaisesReturnsBackRef
ring_of_cliques(num_cliques, clique_size)

A ring of cliques graph is consisting of cliques, connected through single links. Each clique is a complete graph.

Notes

The connected_caveman_graph graph removes a link from each clique to connect it with the next clique. Instead, the ring_of_cliques graph simply adds the link without removing any link from the cliques.

Parameters

num_cliques : int

Number of cliques

clique_size : int

Size of cliques

Raises

NetworkXError

If the number of cliques is lower than 2 or if the size of cliques is smaller than 2.

Returns

G : NetworkX Graph

ring of cliques graph

Defines a "ring of cliques" graph.

See Also

connected_caveman_graph

Examples

>>> G = nx.ring_of_cliques(8, 4)
See :

Back References

The following pages refer to to this document either explicitly or contain code examples using this.

networkx.generators.community.ring_of_cliques

Local connectivity graph

Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.

Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)

SVG is more flexible but power hungry; and does not scale well to 50 + nodes.

All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them


GitHub : /networkx/generators/community.py#381
type: <class 'function'>
Commit: