COIN-OR::LEMON - Graph Library

Ignore:
Timestamp:
08/09/13 11:29:40 (6 years ago)
Author:
Alpar Juttner <alpar@…>
Branch:
default
Children:
1279:00f6088403c0, 1281:c08d0f04c117, 1386:ad22262328b3
Phase:
public
Message:

Remove long lines (from all but one file)

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/max_cardinality_search.h

    r1270 r1271  
    165165    ///
    166166    /// This function instantiates a \ref CardinalityMap.
    167     /// \param digraph is the digraph, to which we would like to define the \ref
    168     /// CardinalityMap
     167    /// \param digraph is the digraph, to which we would like to
     168    /// define the \ref CardinalityMap
    169169    static CardinalityMap *createCardinalityMap(const Digraph &digraph) {
    170170      return new CardinalityMap(digraph);
     
    181181  /// Search algorithm. The maximum cardinality search first chooses any
    182182  /// node of the digraph. Then every time it chooses one unprocessed node
    183   /// with maximum cardinality, i.e the sum of capacities on out arcs to the nodes
     183  /// with maximum cardinality, i.e the sum of capacities on out arcs
     184  /// to the nodes
    184185  /// which were previusly processed.
    185186  /// If there is a cut in the digraph the algorithm should choose
Note: See TracChangeset for help on using the changeset viewer.