1.1 --- a/doc/groups.dox Wed Apr 29 19:22:14 2009 +0100
1.2 +++ b/doc/groups.dox Thu May 07 02:07:59 2009 +0200
1.3 @@ -335,8 +335,13 @@
1.4
1.5 In most cases the \ref Preflow "Preflow" algorithm provides the
1.6 fastest method for computing a maximum flow. All implementations
1.7 -provides functions to also query the minimum cut, which is the dual
1.8 -problem of the maximum flow.
1.9 +also provide functions to query the minimum cut, which is the dual
1.10 +problem of maximum flow.
1.11 +
1.12 +\ref Circulation is a preflow push-relabel algorithm implemented directly
1.13 +for finding feasible circulations, which is a somewhat different problem,
1.14 +but it is strongly related to maximum flow.
1.15 +For more information, see \ref Circulation.
1.16 */
1.17
1.18 /**
1.19 @@ -541,10 +546,10 @@
1.20 /**
1.21 @defgroup spantree Minimum Spanning Tree Algorithms
1.22 @ingroup algs
1.23 -\brief Algorithms for finding a minimum cost spanning tree in a graph.
1.24 +\brief Algorithms for finding minimum cost spanning trees and arborescences.
1.25
1.26 -This group contains the algorithms for finding a minimum cost spanning
1.27 -tree in a graph.
1.28 +This group contains the algorithms for finding minimum cost spanning
1.29 +trees and arborescences.
1.30 */
1.31
1.32 /**