Algorithms ========== The same group on the `Doxygen site <../../group__algs.html>`__. .. doxygengroup:: algs :desc-only: .. rubric:: Subgroups .. list-table:: :header-rows: 1 :widths: 30 70 :width: 100% * - Group - Description * - :doc:`Graph Search ` - Common graph search algorithms. * - :doc:`Shortest Path Algorithms ` - Algorithms for finding shortest paths. * - :doc:`Minimum Spanning Tree Algorithms ` - Algorithms for finding minimum cost spanning trees and arborescences. * - :doc:`Maximum Flow Algorithms ` - Algorithms for finding maximum flows. * - :doc:`Minimum Cost Flow Algorithms ` - Algorithms for finding minimum cost flows and circulations. * - :doc:`Minimum Cut Algorithms ` - Algorithms for finding minimum cut in graphs. * - :doc:`Minimum Mean Cycle Algorithms ` - Algorithms for finding minimum mean cycles. * - :doc:`Matching Algorithms ` - Algorithms for finding matchings in graphs and bipartite graphs. * - :doc:`Connectivity and Other Graph Properties ` - Algorithms for discovering the graph properties. * - :doc:`Graph Isomorphism ` - Algorithms for testing (sub)graph isomorphism. * - :doc:`Planar Embedding and Drawing ` - Algorithms for planarity checking, embedding and drawing. * - :doc:`Traveling Salesman Problem ` - Algorithms for the symmetric traveling salesman problem. * - :doc:`Approximation Algorithms ` - Approximation algorithms. * - :doc:`Auxiliary Algorithms ` - Auxiliary algorithms implemented in LEMON. .. toctree:: :hidden: group__search group__shortest__path group__spantree group__max__flow group__min__cost__flow__algs group__min__cut group__min__mean__cycle group__matching group__graph__properties group__graph__isomorphism group__planar group__tsp group__approx__algs group__auxalg