original_docstring: 
      The original implementation of is_clique is based on Metanomes' implementation.
      See Also
          https://github.com/HPI-Information-Systems/inclusion-dependency-algorithms/blob/master/adp-algorithms/find2/src/main/java/de/metanome/algorithms/find2/Hypergraph.java#L122
      However, it would seem that test may give false positives. This candidate is an example:
  
      It is true, however, that generate_clique_candidate will not consider the full graph
      a candidate, but I am not so sure for higher arities if this may not happen
      
docstring: The original implementation of is_clique is based on Metanomes' implementation.
  
  It is true, however, that generate_clique_candidate will not consider the full graph
  a candidate, but I am not so sure for higher arities if this may not happen
docstring_tokens: The original implementation of is_clique is based on Metanomes ' implementation . It is true however that generate_clique_candidate will not consider the full graph a candidate but I am not so sure for higher arities if this may not happen
code: def square():
      """
      The original implementation of is_clique is based on Metanomes' implementation.
      See Also
          https://github.com/HPI-Information-Systems/inclusion-dependency-algorithms/blob/master/adp-algorithms/find2/src/main/java/de/metanome/algorithms/find2/Hypergraph.java#L122
      However, it would seem that test may give false positives. This candidate is an example:
  
      It is true, however, that generate_clique_candidate will not consider the full graph
      a candidate, but I am not so sure for higher arities if this may not happen
      """
      return Graph(
          V={0, 1, 2, 3},
          E=set(map(Edge, [
              {0, 1}, {1, 2}, {2, 3}, {3, 0}
          ]))
      )
code_tokens: def square ( ) : return Graph ( V = { 0 , 1 , 2 , 3 } , E = set ( map ( Edge , [ { 0 , 1 } , { 1 , 2 } , { 2 , 3 } , { 3 , 0 } ] ) ) )
short_docstring: The original implementation of is_clique is based on Metanomes' implementation.
short_docstring_tokens: The original implementation of is_clique is based on Metanomes ' implementation .
comment: """
      The original implementation of is_clique is based on Metanomes' implementation.
      See Also
          https://github.com/HPI-Information-Systems/inclusion-dependency-algorithms/blob/master/adp-algorithms/find2/src/main/java/de/metanome/algorithms/find2/Hypergraph.java#L122
      However, it would seem that test may give false positives. This candidate is an example:
  
      It is true, however, that generate_clique_candidate will not consider the full graph
      a candidate, but I am not so sure for higher arities if this may not happen
      """