.. _sphx_glr_api_gallery_graph_theory_eulerian:

Eulerian paths
----------------

Euler's Seven Bridges of Königsberg and the odd-degree criterion.


.. 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="Reduces Königsberg to four land masses joined by seven bridges and counts the bridges at each land mass. All four counts are odd, so by Euler&#x27;s argument no walk can cross every bridge exactly once, and an exhaustive search agrees. Removing a single bridge leaves exactly two odd land masses, and a walk over every remaining bridge appears.">

.. only:: html

  .. image:: /api/gallery/graph_theory/eulerian/images/thumb/sphx_glr_plot_01_konigsberg_bridges_thumb.png
    :alt:

  :doc:`/api/gallery/graph_theory/eulerian/plot_01_konigsberg_bridges`

.. raw:: html

      <div class="sphx-glr-thumbnail-title">Euler and the Seven Bridges of Königsberg</div>
    </div>


.. thumbnail-parent-div-close

.. raw:: html

    </div>


.. toctree::
   :hidden:

   /api/gallery/graph_theory/eulerian/plot_01_konigsberg_bridges