lemon: comparison doc/groups.dox

equal deleted inserted replaced

-:18297b9fca6a
+:e7c3b13872ff
 - \ref DinitzSleatorTarjan Dinitz's blocking flow algorithm with dynamic trees.
 - \ref GoldbergTarjan Preflow push-relabel algorithm with dynamic trees.
 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
+also provide functions to query the minimum cut, which is the dual
-problem of the maximum flow.
+problem of maximum flow.
+\ref Circulation is a preflow push-relabel 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.
 */
 /**
 @defgroup min_cost_flow Minimum Cost Flow Algorithms
 @ingroup algs
 */
 /**
 @defgroup spantree Minimum Spanning Tree Algorithms
 @ingroup algs
-\brief 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 a minimum cost spanning
+This group contains the algorithms for finding minimum cost spanning
-tree in a graph.
+trees and arborescences.
 */
 /**
 @defgroup auxalg Auxiliary Algorithms
 @ingroup algs