COIN-OR::LEMON - Graph Library

Changeset 1270:806451fd084b in lemon-0.x for src/lemon/min_cost_flow.h


Ignore:
Timestamp:
03/29/05 09:35:09 (16 years ago)
Author:
jacint
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1698
Message:

bugfixes in doc

File:
1 edited

Legend:

Unmodified
Added
Removed
  • src/lemon/min_cost_flow.h

    r1164 r1270  
    3737  ///
    3838  ///
    39   /// The class \ref lemon::MinCostFlow "MinCostFlow" implements
    40   /// an algorithm for finding a flow of value \c k
    41   /// having minimal total cost
    42   /// from a given source node to a given target node in an
    43   /// edge-weighted directed graph. To this end,
    44   /// the edge-capacities and edge-weitghs have to be nonnegative.
    45   /// The edge-capacities should be integers, but the edge-weights can be
    46   /// integers, reals or of other comparable numeric type.
    47   /// This algorithm is intended to use only for small values of \c k,
    48   /// since it is only polynomial in k,
    49   /// not in the length of k (which is log k).
    50   /// In order to find the minimum cost flow of value \c k it
    51   /// finds the minimum cost flow of value \c i for every
    52   /// \c i between 0 and \c k.
     39  /// The class \ref lemon::MinCostFlow "MinCostFlow" implements an
     40  /// 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.
    5351  ///
    5452  ///\param Graph The directed graph type the algorithm runs on.
     
    150148          potential.set(n, potential[n]+dijkstra.distMap()[n]);
    151149       
    152         //Augmenting on the sortest path
     150        //Augmenting on the shortest path
    153151        Node n=t;
    154152        ResGraphEdge e;
     
    227225
    228226    This function checks, whether the given flow and potential
    229     satisfiy the complementary slackness cnditions (i.e. these are optimal).
     227    satisfy the complementary slackness conditions (i.e. these are optimal).
    230228    This function only checks optimality, doesn't bother with feasibility.
    231229    For testing purpose.
Note: See TracChangeset for help on using the changeset viewer.