Changeset - r444:cace3206223b
« 439:62c1ed
445:b25645 »
gravatar
deba@inf.elte.hu
deba@inf.elte.hu
Fix typos (ticket #192)
0 3 0
default
3 files changed with 4 insertions and 4 deletions:
lemon/connectivity.h
2
2
lemon/max_matching.h
1
1
lemon/suurballe.h
1
1
↑ Collapse diff ↑
lemon/connectivity.h
Ignore white space 6 line context
... ... 
@@ -297,3 +297,3 @@
297 297 
  ///
298 
  /// \param graph The graph.
298 
  /// \param digraph The graph.
299 299 
  /// \return The number of components
... ... 
@@ -1227,3 +1227,3 @@
1227 1227 
  ///
1228 
  /// \param graph The graph. It must be directed and acyclic.
1228 
  /// \param digraph The graph. It must be directed and acyclic.
1229 1229 
  /// \retval order A readable - writable node map. The values will be set
lemon/max_matching.h
Show white space 6 line context
... ... 
@@ -418,3 +418,3 @@
418 418 
    /// functions first, then you can start the algorithm with the \ref
419 
    /// startParse() or startDense() functions.
419 
    /// startSparse() or startDense() functions.
420 420 

			




        

    

    

    

        

            

                

                    lemon/suurballe.h
                

                

                  
                  
                  
                  Ignore white space
                  6 line context
                

                
                  
                
            

        

        

            

            



	...
	...
	
		
@@ -53,3 +53,3 @@


			




	53
	53
	
		
  /// \note For finding node-disjoint paths this algorithm can be used


			




	54
	
	
		
  /// with \ref SplitDigraphAdaptor.


			




	
	54
	
		
  /// with \ref SplitNodes.


			




	55
	55
	
		
#ifdef DOXYGEN


			




        

    






    
    



    


    

     
    
0 comments (0 inline)