1.1 --- a/lemon/max_cardinality_search.h	Fri Aug 09 11:28:17 2013 +0200
     1.2 +++ b/lemon/max_cardinality_search.h	Fri Aug 09 11:29:40 2013 +0200
     1.3 @@ -164,8 +164,8 @@
     1.4      /// \brief Instantiates a CardinalityMap.
     1.5      ///
     1.6      /// This function instantiates a \ref CardinalityMap.
     1.7 -    /// \param digraph is the digraph, to which we would like to define the \ref
     1.8 -    /// CardinalityMap
     1.9 +    /// \param digraph is the digraph, to which we would like to
    1.10 +    /// define the \ref CardinalityMap
    1.11      static CardinalityMap *createCardinalityMap(const Digraph &digraph) {
    1.12        return new CardinalityMap(digraph);
    1.13      }
    1.14 @@ -180,7 +180,8 @@
    1.15    /// This class provides an efficient implementation of Maximum Cardinality
    1.16    /// Search algorithm. The maximum cardinality search first chooses any
    1.17    /// node of the digraph. Then every time it chooses one unprocessed node
    1.18 -  /// with maximum cardinality, i.e the sum of capacities on out arcs to the nodes
    1.19 +  /// with maximum cardinality, i.e the sum of capacities on out arcs
    1.20 +  /// to the nodes
    1.21    /// which were previusly processed.
    1.22    /// If there is a cut in the digraph the algorithm should choose
    1.23    /// again any unprocessed node of the digraph.