Create a bipartite clique graph from a graph G.
Nodes of G are retained as the “bottom nodes” of B and cliques of G become “top nodes” of B. Edges are present if a bottom node belongs to the clique represented by the top node.
Returns a Graph with additional attribute dict B.node_type which is keyed by nodes to “Bottom” or “Top” appropriately.
if fpos is not None, a second additional attribute dict B.pos is created to hold the position tuple of each node for viewing the bipartite graph.