COIN-OR::LEMON - Graph Library

Changeset 1527:7ceab500e1f6 in lemon-0.x for lemon/min_cost_flow.h


Ignore:
Timestamp:
07/01/05 12:33:27 (15 years ago)
Author:
athos
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@2014
Message:

Doc review+corrections in my own documentation according to the reviewers comments.

File:
1 edited

Legend:

Unmodified
Added
Removed
  • lemon/min_cost_flow.h

    r1435 r1527  
    3939  /// The class \ref lemon::MinCostFlow "MinCostFlow" implements an
    4040  /// algorithm for finding a flow of value \c k having minimal total
    41   /// cost from a given source node to a given target node in an
    42   /// edge-weighted directed graph. To this end, the edge-capacities
    43   /// and edge-weights have to be nonnegative.  The edge-capacities
    44   /// should be integers, but the edge-weights can be integers, reals
    45   /// or of other comparable numeric type.  This algorithm is intended
    46   /// to be used only for small values of \c k, since it is only
    47   /// polynomial in k, not in the length of k (which is log k): in
    48   /// order to find the minimum cost flow of value \c k it finds the
    49   /// minimum cost flow of value \c i for every \c i between 0 and \c
    50   /// k.
     41  /// cost from a given source node to a given target node in a
     42  /// directed graph with a cost function on the edges. To
     43  /// this end, the edge-capacities and edge-costs have to be
     44  /// nonnegative.  The edge-capacities should be integers, but the
     45  /// edge-costs can be integers, reals or of other comparable
     46  /// numeric type.  This algorithm is intended to be used only for
     47  /// small values of \c k, since it is only polynomial in k, not in
     48  /// the length of k (which is log k): in order to find the minimum
     49  /// cost flow of value \c k it finds the minimum cost flow of value
     50  /// \c i for every \c i between 0 and \c k.
    5151  ///
    5252  ///\param Graph The directed graph type the algorithm runs on.
     
    118118   
    119119    \param _g The directed graph the algorithm runs on.
    120     \param _length The length (weight or cost) of the edges.
     120    \param _length The length (cost) of the edges.
    121121    \param _cap The capacity of the edges.
    122122    \param _s Source node.
     
    204204    }
    205205
    206     /// Total weight of the found flow.
    207 
    208     /// This function gives back the total weight of the found flow.
     206    /// Total cost of the found flow.
     207
     208    /// This function gives back the total cost of the found flow.
    209209    Length totalLength(){
    210210      return total_length;
Note: See TracChangeset for help on using the changeset viewer.