# HG changeset patch
# User Peter Kovacs <kpeter@inf.elte.hu>
# Date 1255633490 -7200
# Node ID 30c77d1c0cba549cb3f5309642d576cfa9c16534
# Parent c67e235c832ff2ceb8cb0dd46df952afb98867c8
Remove unnecessary integer requirement in Suurballe (#323)
diff --git a/lemon/suurballe.h b/lemon/suurballe.h
a
|
b
|
|
55 | 55 | /// \tparam LEN The type of the length map. |
56 | 56 | /// The default value is <tt>GR::ArcMap<int></tt>. |
57 | 57 | /// |
58 | | /// \warning Length values should be \e non-negative \e integers. |
| 58 | /// \warning Length values should be \e non-negative. |
59 | 59 | /// |
60 | 60 | /// \note For finding node-disjoint paths this algorithm can be used |
61 | 61 | /// along with the \ref SplitNodes adaptor. |
… |
… |
|
252 | 252 | const LengthMap &length ) : |
253 | 253 | _graph(graph), _length(length), _flow(0), _local_flow(false), |
254 | 254 | _potential(0), _local_potential(false), _pred(graph) |
255 | | { |
256 | | LEMON_ASSERT(std::numeric_limits<Length>::is_integer, |
257 | | "The length type of Suurballe must be integer"); |
258 | | } |
| 255 | {} |
259 | 256 | |
260 | 257 | /// Destructor. |
261 | 258 | ~Suurballe() { |