node_clique_number(G, nodes=None, cliques=None, separate_nodes=False)
Returns a single or list depending on input nodes. An optional list of cliques can be input if already computed.
An undirected graph.
A list of cliques, each of which is itself a list of nodes. If not specified, the list of all cliques will be computed using find_cliques
.
If nodes
is a single node, returns the size of the largest maximal clique in G containing that node. Otherwise return a dict keyed by node to the size of the largest maximal clique containing that node.
Returns the size of the largest maximal clique containing each given node.
find_cliques
find_cliques yields the maximal cliques of G. It accepts a :None:None:`nodes` argument which restricts consideration to maximal cliques containing all the given :None:None:`nodes`. The search for the cliques is optimized for :None:None:`nodes`.
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