Changeset - r823:a7e93de12cbd
« 822:f90326
839:f3bc4e »
830:75c97c »
827:8131c2 »
825:75e602 »
824:974c48 »
gravatar
kpeter (Peter Kovacs)
kpeter@inf.elte.hu
Add a warning about huge capacities in Preflow (#319)
0 1 0
default
1 file changed with 3 insertions and 0 deletions:
lemon/preflow.h
3
↑ Collapse diff ↑
lemon/preflow.h
Ignore white space 12 line context
... ... 
@@ -110,12 +110,15 @@
110 110 
  /// The worst case time complexity of the algorithm is \f$O(n^2\sqrt{e})\f$.
111 111 
  ///
112 112 
  /// The algorithm consists of two phases. After the first phase
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>".
119 122 
#ifdef DOXYGEN
120 123 
  template <typename GR, typename CAP, typename TR>
121 124 
#else
0 comments (0 inline)