Changeset - r781:6f10c6ec5a21
« 731:097704
782:ceb275 »
gravatar
kpeter (Peter Kovacs)
kpeter@inf.elte.hu
Small fixes related to BellmanFord (#51) - Add a missing #include. - Add a missing const keyword for negativeCycle(). - Test if negativeCycle() is const function.
0 2 0
default
2 files changed with 4 insertions and 1 deletions:
lemon/bellman_ford.h
2
1
test/bellman_ford_test.cc
2
↑ Collapse diff ↑
lemon/bellman_ford.h
Ignore white space 6 line context
... ... 
@@ -24,4 +24,5 @@
24 24 
/// \brief Bellman-Ford algorithm.
25 25 

			




	
	26
	
		
#include <lemon/list_graph.h>


			




	26
	27
	
		
#include <lemon/bits/path_dump.h>


			




	27
	28
	
		
#include <lemon/core.h>


			




	...
	...
	
		
@@ -776,5 +777,5 @@


			




	776
	777
	
		
    /// length if the algorithm has already found one.


			




	777
	778
	
		
    /// Otherwise it gives back an empty path.


			




	778
	
	
		
    lemon::Path<Digraph> negativeCycle() {


			




	
	779
	
		
    lemon::Path<Digraph> negativeCycle() const {


			




	779
	780
	
		
      typename Digraph::template NodeMap<int> state(*_gr, -1);


			




	780
	781
	
		
      lemon::Path<Digraph> cycle;

			




        

    

    

    

        

            

                

                    test/bellman_ford_test.cc
                

                

                  
                  
                  
                  Ignore white space
                  4 line context
                

                
                  
                
            

        

        

            

            



	...
	...
	
		
@@ -97,4 +97,5 @@


			




	97
	97
	
		
    p  = const_bf_test.predMap();


			




	98
	98
	
		
    pp = const_bf_test.path(t);


			




	
	99
	
		
    pp = const_bf_test.negativeCycle();


			




	99
	100
	
		
    


			




	100
	101
	
		
    for (BF::ActiveIt it(const_bf_test); it != INVALID; ++it) {}


			




	...
	...
	
		
@@ -133,4 +134,5 @@


			




	133
	134
	
		
    b  = bf_test.reached(t);


			




	134
	135
	
		
    pp = bf_test.path(t);


			




	
	136
	
		
    pp = bf_test.negativeCycle();


			




	135
	137
	
		
  }


			




	136
	138
	
		
}


			




        

    






    
    



    


    

     
    
0 comments (0 inline)