def make_clique_bipartite(G, fpos=None, create_using=None, name=None):
 B = (create_using if (create_using is not None) else networkx.Graph())
 B.clear()
 B.add_nodes_from(G, bipartite=1)
 for (i, cl) in enumerate(find_cliques(G)):
  name = ((- i) - 1)
  B.add_node(name, bipartite=0)
  B.add_edges_from(((v, name) for v in cl))
 return B

def make_clique_bipartite ( G , fpos = None , create_using = None , name = None ) : B = ( create_using if ( create_using is not None ) else networkx . Graph ( ) ) B . clear ( ) B . add_nodes_from ( G , bipartite = 1 ) for ( i , cl ) in enumerate ( find_cliques ( G ) ) : name = ( ( - i ) - 1 ) B . add_node ( name , bipartite = 0 ) B . add_edges_from ( ( ( v , name ) for v in cl ) ) return B
returns the bipartite clique graph corresponding to g .