.. _index_graphs:

============
dwave-graphs
============


.. toctree::
    :caption: Reference documentation for dwave-graphs:
    :maxdepth: 1

    api_ref


About dwave-graphs
==================

.. include:: README.rst
    :start-after: start_graphs_about
    :end-before: end_graphs_about

Functions such as :func:`.draw_pegasus` provide easy visualization for
:term:`Pegasus` graphs while functions such as
:func:`~dwave.graphs.algorithms.max_cut.maximum_cut` or
:func:`~dwave.graphs.algorithms.cover.min_vertex_cover` provide graph
algorithms useful to optimization problems that fit well with |dwave_short|
quantum computers.

Like |dwave_short| quantum computers, all other supported samplers must have
``sample_qubo`` and ``sample_ising`` methods for solving :term:`Ising` and
:term:`QUBO` models and return an iterable of samples in order of increasing
energy.

Usage Information
=================

*   :ref:`index_concepts` for terminology
*   :ref:`qpu_topologies` for an introduction to :term:`QPU`
    :term:`topologies <topology>` such as the :term:`Pegasus` graph
*   :ref:`concept_models_bqm` for an introduction to binary quadratic models
    (:term:`BQM`)
*   :ref:`concept_samplers` for an introduction to :term:`samplers <sampler>`