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