1.1 --- a/lemon/circulation.h	Wed Feb 21 13:49:19 2007 +0000
     1.2 +++ b/lemon/circulation.h	Wed Feb 21 13:51:45 2007 +0000
     1.3 @@ -31,7 +31,7 @@
     1.4  
     1.5    ///Preflow algorithm for the Network Circulation Problem.
     1.6    
     1.7 -  ///\ingroup flowalgs
     1.8 +  ///\ingroup max_flow
     1.9    ///This class implements a preflow algorithm
    1.10    ///for the Network Circulation Problem.
    1.11    ///The exact formulation of this problem is the following.

     2.1 --- a/lemon/suurballe.h	Wed Feb 21 13:49:19 2007 +0000
     2.2 +++ b/lemon/suurballe.h	Wed Feb 21 13:51:45 2007 +0000
     2.3 @@ -19,7 +19,7 @@
     2.4  #ifndef LEMON_SUURBALLE_H
     2.5  #define LEMON_SUURBALLE_H
     2.6  
     2.7 -///\ingroup flowalgs
     2.8 +///\ingroup shortest_path
     2.9  ///\file
    2.10  ///\brief An algorithm for finding k paths of minimal total length.
    2.11