COIN-OR::LEMON - Graph Library

Changeset 2352:5e273e0bd5e2 in lemon-0.x


Ignore:
Timestamp:
01/25/07 15:36:21 (11 years ago)
Author:
alpar
Branch:
default
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@3148
Message:

Doc improvements

Location:
lemon
Files:
2 edited

Legend:

Unmodified
Added
Removed
  • lemon/bipartite_matching.h

    r2269 r2352  
    165165    /// 
    166166    /// It runs an augmenting phase of the Hopcroft-Karp 
    167     /// algorithm. The phase finds maximum count of edge disjoint 
     167    /// algorithm. This phase finds maximum count of edge disjoint 
    168168    /// augmenting paths and augments on these paths. The algorithm 
    169169    /// consists at most of \f$ O(\sqrt{n}) \f$ phase and one phase is 
     
    259259    /// 
    260260    /// It runs an augmenting phase of the Ford-Fulkerson 
    261     /// algorithm. The phase finds only one augmenting path and  
     261    /// algorithm. This phase finds only one augmenting path and  
    262262    /// augments only on this paths. The algorithm consists at most  
    263263    /// of \f$ O(n) \f$ simple phase and one phase is at most  
     
    735735    /// 
    736736    /// It runs an augmenting phase of the weighted matching  
    737     /// algorithm. The phase finds the best augmenting path and  
     737    /// algorithm. This phase finds the best augmenting path and  
    738738    /// augments only on this paths.  
    739739    /// 
  • lemon/elevator.h

    r2350 r2352  
    3636  /// 
    3737  ///\ingroup auxdat 
    38   ///Using this class you can assign "labels" (nonnegativ integer numbers) 
     38  ///Using this class you can assign "labels" (nonnegative integer numbers) 
    3939  ///to the edges or nodes of a graph, manipulate and query them through 
    4040  ///operations typically arising in "push-relabel" type algorithms. 
Note: See TracChangeset for help on using the changeset viewer.