Changes in doc/groups.dox [651:3adf5e2d1e62:640:6c408d864fa1] in lemon-main

File:

• doc/groups.dox (modified) (2 diffs)

doc/groups.dox

@@ -336 +336 @@
 In most cases the \ref Preflow "Preflow" algorithm provides the
 fastest method for computing a maximum flow. All implementations
-also provide functions to query the minimum cut, which is the dual
-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.
+provides functions to also query the minimum cut, which is the dual
+problem of the maximum flow.
 */
 
@@ -547 +542 @@
 @defgroup spantree Minimum Spanning Tree Algorithms
 @ingroup algs
-\brief Algorithms for finding minimum cost spanning trees and arborescences.
-
-This group contains the algorithms for finding minimum cost spanning
-trees and arborescences.
+\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.
 */