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

Timestamp:

03/29/05 09:35:09 (20 years ago)

Author:

jacint

Branch:

default

Phase:

public

Convert:

svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@1698

Message:

bugfixes in doc

File:

• src/lemon/min_cost_flow.h (modified) (3 diffs)

src/lemon/min_cost_flow.h

@@ -37 +37 @@
   /// 
   ///
-  /// The class \ref lemon::MinCostFlow "MinCostFlow" implements
-  /// an algorithm for finding a flow of value \c k 
-  /// having minimal total cost 
-  /// from a given source node to a given target node in an
-  /// edge-weighted directed graph. To this end, 
-  /// the edge-capacities and edge-weitghs have to be nonnegative. 
-  /// The edge-capacities should be integers, but the edge-weights can be 
-  /// integers, reals or of other comparable numeric type.
-  /// This algorithm is intended to use only for small values of \c k, 
-  /// since it is only polynomial in k, 
-  /// not in the length of k (which is log k). 
-  /// In order to find the minimum cost flow of value \c k it 
-  /// finds the minimum cost flow of value \c i for every 
-  /// \c i between 0 and \c k. 
+  /// The class \ref lemon::MinCostFlow "MinCostFlow" implements an
+  /// algorithm for finding a flow of value \c k having minimal total
+  /// cost from a given source node to a given target node in an
+  /// edge-weighted directed graph. To this end, the edge-capacities
+  /// and edge-weights have to be nonnegative.  The edge-capacities
+  /// should be integers, but the edge-weights can be integers, reals
+  /// or of other comparable numeric type.  This algorithm is intended
+  /// to be used only for small values of \c k, since it is only
+  /// polynomial in k, not in the length of k (which is log k):  in
+  /// order to find the minimum cost flow of value \c k it finds the
+  /// minimum cost flow of value \c i for every \c i between 0 and \c
+  /// k.
   ///
   ///\param Graph The directed graph type the algorithm runs on.
@@ -150 +148 @@
           potential.set(n, potential[n]+dijkstra.distMap()[n]);
         
-        //Augmenting on the sortest path
+        //Augmenting on the shortest path
         Node n=t;
         ResGraphEdge e;
@@ -227 +225 @@
 
     This function checks, whether the given flow and potential 
-    satisfiy the complementary slackness cnditions (i.e. these are optimal).
+    satisfy the complementary slackness conditions (i.e. these are optimal).
     This function only checks optimality, doesn't bother with feasibility.
     For testing purpose.