# HG changeset patch
# User Peter Kovacs <kpeter@inf.elte.hu>
# Date 1265754591 -3600
# Node ID a7e93de12cbda2267756b130476b8e84572002bf
# Parent f903263902f6831f14205dab9f1d00cb5275e171
Add a warning about huge capacities in Preflow (#319)
diff --git a/lemon/preflow.h b/lemon/preflow.h
|
a
|
b
|
|
| 113 | 113 | /// the maximum flow value and the minimum cut is obtained. The |
| 114 | 114 | /// second phase constructs a feasible maximum flow on each arc. |
| 115 | 115 | /// |
| | 116 | /// \warning This implementation cannot handle infinite or very large |
| | 117 | /// capacities (e.g. the maximum value of \c CAP::Value). |
| | 118 | /// |
| 116 | 119 | /// \tparam GR The type of the digraph the algorithm runs on. |
| 117 | 120 | /// \tparam CAP The type of the capacity map. The default map |
| 118 | 121 | /// type is \ref concepts::Digraph::ArcMap "GR::ArcMap<int>". |
