# HG changeset patch
# User Alpar Juttner <alpar@cs.elte.hu>
# Date 1267632008 0
# Node ID 7bf1117178af42e8bf07765491e2276cee5c1e99
# Parent  2f9d9bcc1867da9757cc0368174fd6c396114af0# Parent  30c77d1c0cba549cb3f5309642d576cfa9c16534
Merge bugfixes #323 to branch 1.1

diff -r 2f9d9bcc1867 -r 7bf1117178af lemon/suurballe.h
--- a/lemon/suurballe.h	Fri Feb 26 17:08:30 2010 +0100
+++ b/lemon/suurballe.h	Wed Mar 03 16:00:08 2010 +0000
@@ -55,7 +55,7 @@
   /// \tparam LEN The type of the length map.
   /// The default value is <tt>GR::ArcMap<int></tt>.
   ///
-  /// \warning Length values should be \e non-negative \e integers.
+  /// \warning Length values should be \e non-negative.
   ///
   /// \note For finding node-disjoint paths this algorithm can be used
   /// along with the \ref SplitNodes adaptor.
@@ -252,10 +252,7 @@
                const LengthMap &length ) :
       _graph(graph), _length(length), _flow(0), _local_flow(false),
       _potential(0), _local_potential(false), _pred(graph)
-    {
-      LEMON_ASSERT(std::numeric_limits<Length>::is_integer,
-        "The length type of Suurballe must be integer");
-    }
+    {}
 
     /// Destructor.
     ~Suurballe() {
@@ -520,7 +517,7 @@
     ///
     /// \pre \ref run() or \ref findPaths() must be called before using
     /// this function.
-    Path path(int i) const {
+    const Path& path(int i) const {
       return paths[i];
     }