.. _sphx_glr_api_gallery_graph_theory_matching:

Bipartite matching
------------------

Maximum matchings and König's minimum vertex covers.


.. raw:: html

  <div id='sg-tag-list' class='sphx-glr-tag-list'></div>


.. raw:: html

    <div class="sphx-glr-thumbnails">

.. thumbnail-parent-div-open

.. raw:: html

    <div class="sphx-glr-thumbcontainer" tooltip="Finds a maximum matching in a random bipartite graph with the Hopcroft-Karp algorithm and builds a vertex cover of exactly the same size, as König&#x27;s theorem guarantees.">

.. only:: html

  .. image:: /api/gallery/graph_theory/matching/images/thumb/sphx_glr_plot_01_konig_hopcroft_karp_thumb.png
    :alt:

  :doc:`/api/gallery/graph_theory/matching/plot_01_konig_hopcroft_karp`

.. raw:: html

      <div class="sphx-glr-thumbnail-title">König's theorem and Hopcroft-Karp matching</div>
    </div>


.. thumbnail-parent-div-close

.. raw:: html

    </div>


.. toctree::
   :hidden:

   /api/gallery/graph_theory/matching/plot_01_konig_hopcroft_karp