# HG changeset patch
# User deba
# Date 1172065905 0
# Node ID c479eab00a189cdcb8567aa0676d7e528c1f708d
# Parent  83775fab25dc315305f09d3af5767e35ba537ba4
Once again minor doc changes

diff -r 83775fab25dc -r c479eab00a18 lemon/circulation.h
--- a/lemon/circulation.h	Wed Feb 21 13:49:19 2007 +0000
+++ b/lemon/circulation.h	Wed Feb 21 13:51:45 2007 +0000
@@ -31,7 +31,7 @@
 
   ///Preflow algorithm for the Network Circulation Problem.
   
-  ///\ingroup flowalgs
+  ///\ingroup max_flow
   ///This class implements a preflow algorithm
   ///for the Network Circulation Problem.
   ///The exact formulation of this problem is the following.
diff -r 83775fab25dc -r c479eab00a18 lemon/suurballe.h
--- a/lemon/suurballe.h	Wed Feb 21 13:49:19 2007 +0000
+++ b/lemon/suurballe.h	Wed Feb 21 13:51:45 2007 +0000
@@ -19,7 +19,7 @@
 #ifndef LEMON_SUURBALLE_H
 #define LEMON_SUURBALLE_H
 
-///\ingroup flowalgs
+///\ingroup shortest_path
 ///\file
 ///\brief An algorithm for finding k paths of minimal total length.