1.1 --- a/lemon/preflow.h	Mon Dec 14 06:07:52 2009 +0100
     1.2 +++ b/lemon/preflow.h	Tue Feb 09 23:29:51 2010 +0100
     1.3 @@ -113,6 +113,9 @@
     1.4    /// the maximum flow value and the minimum cut is obtained. The
     1.5    /// second phase constructs a feasible maximum flow on each arc.
     1.6    ///
     1.7 +  /// \warning This implementation cannot handle infinite or very large
     1.8 +  /// capacities (e.g. the maximum value of \c CAP::Value).
     1.9 +  ///
    1.10    /// \tparam GR The type of the digraph the algorithm runs on.
    1.11    /// \tparam CAP The type of the capacity map. The default map
    1.12    /// type is \ref concepts::Digraph::ArcMap "GR::ArcMap<int>".