Changeset 1093:fb1c7da561ce in lemon-main for lemon/max_cardinality_search.h

Timestamp:

08/09/13 11:29:40 (11 years ago)

Author:

Alpar Juttner <alpar@…>

Branch:

default

Children:

1094:c08d0f04c117, 1170:ad22262328b3

Phase:

public

Message:

Remove long lines (from all but one file)

File:

• lemon/max_cardinality_search.h (modified) (2 diffs)

lemon/max_cardinality_search.h

@@ -165 +165 @@
     ///
     /// 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);
@@ -181 +181 @@
   /// 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