***************
Clique
***************

A clique in an undirected graph G = (V, E) is a subset of the vertex set
such that for every two vertices in C there exists an edge connecting the two.

.. figure:: ../../_images/clique.png
   :name: Cover
   :alt: image
   :align: center
   :scale: 40 %

.. automodule:: dwave_networkx.algorithms.clique

.. currentmodule:: dwave_networkx

.. autosummary::
   :toctree: generated/

    maximum_clique
    clique_number
    is_clique
