def make_max_clique_graph(G,create_using=None,name=None):
    cliq=list(map(set,find_cliques(G)))
    if create_using:
        B=create_using
        B.clear()
    else:
        B=networkx.Graph()
    if name is not None:
        B.name=name

    for i,cl in enumerate(cliq):
        B.add_node(i+1)
        for j,other_cl in enumerate(cliq[:i]):
            # if not cl.isdisjoint(other_cl): #Requires 2.6
            intersect=cl & other_cl
            if intersect:     # Not empty
                B.add_edge(i+1,j+1)
    return B
Create the maximal clique graph of a graph.
dataset/ETHPy150Open gkno/gkno_launcher/src/networkx/algorithms/clique.py/make_max_clique_graph