This documents the development version of NetworkX. Documentation for the current release can be found here.
make_clique_bipartite(G, fpos=None, create_using=None, name=None)¶
Returns the bipartite clique graph corresponding to
In the returned bipartite graph, the “bottom” nodes are the nodes of
Gand 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.
- GNetworkX graph
An undirected graph.
If True or not None, the returned graph will have an additional attribute,
pos, a dictionary mapping node to position in the Euclidean plane.
- create_usingNetworkX graph constructor, optional (default=nx.Graph)
Graph type to create. If graph instance, then cleared before populated.
- NetworkX graph
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
Gto the cliques that contain them.
The nodes of the graph
Ghave 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.