Finding the largest clique in a graph is NP-complete problem, so most of these algorithms have an exponential running time; for more information, see the Wikipedia article on the clique problem .
<Unimplemented 'footnote' '.. [1] clique problem:: https://en.wikipedia.org/wiki/Clique_problem'>
Functions for finding and manipulating cliques.
Functions for finding and manipulating cliques.
Finding the largest clique in a graph is NP-complete problem, so most of these algorithms have an exponential running time; for more information, see the Wikipedia article on the clique problem .
<Unimplemented 'footnote' '.. [1] clique problem:: https://en.wikipedia.org/wiki/Clique_problem'>
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.algorithms.approximation.clique.large_clique_size
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