# Changeset 1271:fb1c7da561ce in lemon for lemon

Ignore:
Timestamp:
08/09/13 11:29:40 (7 years ago)
Branch:
default
Children:
Phase:
public
Message:

Remove long lines (from all but one file)

Location:
lemon
Files:
5 edited

Unmodified
Removed
• ## lemon/concepts/digraph.h

 r1270 /// Sets the iterator to the first arc of the given digraph. /// explicit ArcIt(const Digraph& g) { ::lemon::ignore_unused_variable_warning(g); } explicit ArcIt(const Digraph& g) { ::lemon::ignore_unused_variable_warning(g); } /// Sets the iterator to the given arc.
• ## lemon/concepts/graph.h

 r1270 /// Sets the iterator to the first arc of the given graph. /// explicit ArcIt(const Graph &g) { ::lemon::ignore_unused_variable_warning(g); } explicit ArcIt(const Graph &g) { ::lemon::ignore_unused_variable_warning(g); } /// Sets the iterator to the given arc.
• ## lemon/cost_scaling.h

 r1270 /// \ref CostScaling implements a cost scaling algorithm that performs /// push/augment and relabel operations for finding a \ref min_cost_flow /// "minimum cost flow" \cite amo93networkflows, \cite goldberg90approximation, /// "minimum cost flow" \cite amo93networkflows, /// \cite goldberg90approximation, /// \cite goldberg97efficient, \cite bunnagel98efficient. /// It is a highly efficient primal-dual solution method, which typedef std::vector LargeCostVector; typedef std::vector BoolVector; // Note: vector is used instead of vector for efficiency reasons // Note: vector is used instead of vector // for efficiency reasons private:
• ## lemon/howard_mmc.h

 r1270 /// \return The termination cause of the search process. /// For more information, see \ref TerminationCause. TerminationCause findCycleMean(int limit = std::numeric_limits::max()) { TerminationCause findCycleMean(int limit = std::numeric_limits::max()) { // Initialize and find strongly connected components init();
• ## lemon/max_cardinality_search.h

 r1270 /// /// 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); /// 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
Note: See TracChangeset for help on using the changeset viewer.