... | ... |
@@ -54,9 +54,9 @@ |
54 | 54 |
/// \tparam GR The digraph type the algorithm runs on. |
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 |
|
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. |
62 | 62 |
#ifdef DOXYGEN |
... | ... |
@@ -251,12 +251,9 @@ |
251 | 251 |
Suurballe( const Digraph &graph, |
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() { |
262 | 259 |
if (_local_flow) delete _flow; |
0 comments (0 inline)