docstr: Tests that the maximal clique graph is the same as the bipartite
  clique graph after being projected onto the nodes representing the
  cliques.
docstr_tok: ["Tests","that","the","maximal","clique","graph","is","the","same","as","the","bipartite","clique","graph","after","being","projected","onto","the","nodes","representing","the","cliques","."]
code: def test_make_max_clique_graph(self):
      """Tests that the maximal clique graph is the same as the bipartite
      clique graph after being projected onto the nodes representing the
      cliques.
  
      """
      G = self.G
      B = nx.make_clique_bipartite(G)
      # Project onto the nodes representing the cliques.
      H1 = nx.projected_graph(B, range(-5, 0))
      # Relabel the negative numbers as nonnegative ones, starting at
      # 0.
      H1 = nx.relabel_nodes(H1, {-v: v - 1 for v in range(1, 6)})
      H2 = nx.make_max_clique_graph(G)
      assert H1.adj == H2.adj
  
file_path: networkx/networkx/algorithms/tests/test_clique.py
imports: import pytest
  import networkx
  from networkx import convert_node_labels_to_integers
label_desc: Use image node_id 9 for calling the TestCliques obj's underlying member method code with example usage: obj.test_make_max_clique_graph() without return types