1.1 --- a/doc/groups.dox	Wed Feb 21 13:30:21 2007 +0000
     1.2 +++ b/doc/groups.dox	Wed Feb 21 13:49:19 2007 +0000
     1.3 @@ -151,7 +151,8 @@
     1.4  @ingroup algs 
     1.5  \brief This group describes the algorithms for finding maximum flows.
     1.6  
     1.7 -This group describes the algorithms for finding maximum flows.
     1.8 +This group describes the algorithms for finding maximum flows and
     1.9 +feasible circulations.
    1.10  
    1.11  \image html flow.png
    1.12  \image latex flow.eps "Graph flow" width=\textwidth

     2.1 --- a/lemon/csp.h	Wed Feb 21 13:30:21 2007 +0000
     2.2 +++ b/lemon/csp.h	Wed Feb 21 13:49:19 2007 +0000
     2.3 @@ -35,6 +35,8 @@
     2.4  #include <lemon/path.h>
     2.5  #include <lemon/counter.h>
     2.6  namespace lemon {
     2.7 +
     2.8 +  ///\ingroup approx
     2.9    
    2.10    ///Algorithms for the Resource Constrained Shortest Path Problem
    2.11