Minimum Cut Algorithms ====================== The same group on the `Doxygen site <../../group__min__cut.html>`__. .. doxygengroup:: min_cut :desc-only: .. rubric:: Classes .. list-table:: :header-rows: 1 :widths: 30 70 :width: 100% * - Class - Description * - :doc:`GomoryHu ` - Gomory-Hu cut tree algorithm. * - :doc:`HaoOrlin ` - Hao-Orlin algorithm for finding a minimum cut in a digraph. * - :doc:`NagamochiIbaraki ` - Calculates the minimum cut in an undirected graph. .. rubric:: Other classes of its headers .. list-table:: :header-rows: 1 :widths: 30 70 :width: 100% * - Class - Description * - :doc:`NagamochiIbarakiDefaultTraits ` - Default traits class for NagamochiIbaraki class. .. toctree:: :hidden: class_GomoryHu class_HaoOrlin class_NagamochiIbaraki class_NagamochiIbarakiDefaultTraits