# HG changeset patch
# User deba
# Date 1172065759 0
# Node ID 83775fab25dc315305f09d3af5767e35ba537ba4
# Parent  0ed45a6c74b1b0c8dff020c2777805789e8a8efd
Minor changes

diff -r 0ed45a6c74b1 -r 83775fab25dc doc/groups.dox
--- a/doc/groups.dox	Wed Feb 21 13:30:21 2007 +0000
+++ b/doc/groups.dox	Wed Feb 21 13:49:19 2007 +0000
@@ -151,7 +151,8 @@
 @ingroup algs 
 \brief This group describes the algorithms for finding maximum flows.
 
-This group describes the algorithms for finding maximum flows.
+This group describes the algorithms for finding maximum flows and
+feasible circulations.
 
 \image html flow.png
 \image latex flow.eps "Graph flow" width=\textwidth
diff -r 0ed45a6c74b1 -r 83775fab25dc lemon/csp.h
--- a/lemon/csp.h	Wed Feb 21 13:30:21 2007 +0000
+++ b/lemon/csp.h	Wed Feb 21 13:49:19 2007 +0000
@@ -35,6 +35,8 @@
 #include <lemon/path.h>
 #include <lemon/counter.h>
 namespace lemon {
+
+  ///\ingroup approx
   
   ///Algorithms for the Resource Constrained Shortest Path Problem