make_clique_bipartite(G, fpos=None, create_using=None, name=None)
In the returned bipartite graph, the "bottom" nodes are the nodes of G and the "top" nodes represent the maximal cliques of G. There is an edge from node v to clique C in the returned graph if and only if v is an element of C.
An undirected graph.
If True or not None, the returned graph will have an additional attribute, :None:None:`pos`, a dictionary mapping node to position in the Euclidean plane.
Graph type to create. If graph instance, then cleared before populated.
A bipartite graph whose "bottom" set is the nodes of the graph G, whose "top" set is the cliques of G, and whose edges join nodes of G to the cliques that contain them.
The nodes of the graph G have the node attribute 'bipartite' set to 1 and the nodes representing cliques have the node attribute 'bipartite' set to 0, as is the convention for bipartite graphs in NetworkX.
Returns the bipartite clique graph corresponding to G.
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