diff -r dceba191c00d -r fb1c7da561ce lemon/max_cardinality_search.h
--- a/lemon/max_cardinality_search.h	Fri Aug 09 11:28:17 2013 +0200
+++ b/lemon/max_cardinality_search.h	Fri Aug 09 11:29:40 2013 +0200
@@ -164,8 +164,8 @@
     /// \brief Instantiates a CardinalityMap.
     ///
     /// This function instantiates a \ref CardinalityMap.
-    /// \param digraph is the digraph, to which we would like to define the \ref
-    /// CardinalityMap
+    /// \param digraph is the digraph, to which we would like to
+    /// define the \ref CardinalityMap
     static CardinalityMap *createCardinalityMap(const Digraph &digraph) {
       return new CardinalityMap(digraph);
     }
@@ -180,7 +180,8 @@
   /// This class provides an efficient implementation of Maximum Cardinality
   /// Search algorithm. The maximum cardinality search first chooses any
   /// node of the digraph. Then every time it chooses one unprocessed node
-  /// with maximum cardinality, i.e the sum of capacities on out arcs to the nodes
+  /// with maximum cardinality, i.e the sum of capacities on out arcs
+  /// to the nodes
   /// which were previusly processed.
   /// If there is a cut in the digraph the algorithm should choose
   /// again any unprocessed node of the digraph.