Changeset - r852:30c77d1c0cba
« 851:c67e23
867:5b926c »
853:ec0b1b »
gravatar
kpeter (Peter Kovacs)
kpeter@inf.elte.hu
Remove unnecessary integer requirement in Suurballe (#323)
0 1 0
default
1 file changed with 2 insertions and 5 deletions:
lemon/suurballe.h
2
5
↑ Collapse diff ↑
lemon/suurballe.h
Ignore white space 12 line context
... ... 
@@ -52,13 +52,13 @@
52 52 
  /// algorithms.
53 53 
  ///
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 \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.
62 62 
#ifdef DOXYGEN
63 63 
  template <typename GR, typename LEN>
64 64 
#else
... ... 
@@ -249,16 +249,13 @@
249 249 
    /// \param graph The digraph the algorithm runs on.
250 250 
    /// \param length The length (cost) values of the arcs.
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;


			




	263
	260
	
		
      if (_local_potential) delete _potential;


			




	264
	261
	
		
      delete _dijkstra;


			




        

    






    
    



    


    

     
    
0 comments (0 inline)