1.1 --- a/lemon/preflow.h	Mon Sep 28 15:53:20 2009 +0200
     1.2 +++ b/lemon/preflow.h	Thu Nov 05 10:27:17 2009 +0100
     1.3 @@ -102,7 +102,8 @@
     1.4    ///
     1.5    /// This class provides an implementation of Goldberg-Tarjan's \e preflow
     1.6    /// \e push-relabel algorithm producing a \ref max_flow
     1.7 -  /// "flow of maximum value" in a digraph.
     1.8 +  /// "flow of maximum value" in a digraph \ref clrs01algorithms,
     1.9 +  /// \ref amo93networkflows, \ref goldberg88newapproach.
    1.10    /// The preflow algorithms are the fastest known maximum
    1.11    /// flow algorithms. The current implementation uses a mixture of the
    1.12    /// \e "highest label" and the \e "bound decrease" heuristics.