Index: doc/groups.dox
===================================================================
 doc/groups.dox (revision 640)
+++ doc/groups.dox (revision 651)
@@ 336,6 +336,11 @@
In most cases the \ref Preflow "Preflow" algorithm provides the
fastest method for computing a maximum flow. All implementations
provides functions to also query the minimum cut, which is the dual
problem of the maximum flow.
+also provide functions to query the minimum cut, which is the dual
+problem of maximum flow.
+
+\ref Circulation is a preflow pushrelabel algorithm implemented directly
+for finding feasible circulations, which is a somewhat different problem,
+but it is strongly related to maximum flow.
+For more information, see \ref Circulation.
*/
@@ 542,8 +547,8 @@
@defgroup spantree Minimum Spanning Tree Algorithms
@ingroup algs
\brief Algorithms for finding a minimum cost spanning tree in a graph.

This group contains the algorithms for finding a minimum cost spanning
tree in a graph.
+\brief Algorithms for finding minimum cost spanning trees and arborescences.
+
+This group contains the algorithms for finding minimum cost spanning
+trees and arborescences.
*/
Index: doc/mainpage.dox
===================================================================
 doc/mainpage.dox (revision 559)
+++ doc/mainpage.dox (revision 651)
@@ 42,12 +42,8 @@
\subsection howtoread How to read the documentation
If you want to get a quick start and see the most important features then
take a look at our \ref quicktour
"Quick Tour to LEMON" which will guide you along.

If you already feel like using our library, see the
+If you would like to get to know the library, see
LEMON Tutorial.
If you know what you are looking for then try to find it under the
+If you know what you are looking for, then try to find it under the
Modules section.