1.1 --- a/lemon/hao_orlin.h	Tue Feb 20 15:53:33 2007 +0000
     1.2 +++ b/lemon/hao_orlin.h	Wed Feb 21 13:30:21 2007 +0000
     1.3 @@ -34,7 +34,7 @@
     1.4  #include <lemon/iterable_maps.h>
     1.5  
     1.6  /// \file
     1.7 -/// \ingroup flowalgs
     1.8 +/// \ingroup min_cut
     1.9  /// \brief Implementation of the Hao-Orlin algorithm.
    1.10  ///
    1.11  /// Implementation of the HaoOrlin algorithms class for testing network 
    1.12 @@ -42,7 +42,7 @@
    1.13  
    1.14  namespace lemon {
    1.15  
    1.16 -  /// \ingroup flowalgs
    1.17 +  /// \ingroup min_cut
    1.18    ///
    1.19    /// \brief %Hao-Orlin algorithm to find a minimum cut in directed graphs.
    1.20    ///