[Lemon-commits] [lemon_svn] athos: r689 - hugo/trunk/src/work/athos

[Lemon SVN]

Author: athos
Date: Tue May  4 14:00:13 2004
New Revision: 689

Added:
   hugo/trunk/src/work/athos/mincostflows.h
      - copied, changed from r687, /hugo/trunk/src/work/athos/minlengthpaths.h

Log:
Started.

Copied: hugo/trunk/src/work/athos/mincostflows.h (from r687, /hugo/trunk/src/work/athos/minlengthpaths.h)
==============================================================================
--- /hugo/trunk/src/work/athos/minlengthpaths.h	(original)
+++ hugo/trunk/src/work/athos/mincostflows.h	Tue May  4 14:00:13 2004
@@ -1,10 +1,10 @@
 // -*- c++ -*-
-#ifndef HUGO_MINLENGTHPATHS_H
-#define HUGO_MINLENGTHPATHS_H
+#ifndef HUGO_MINCOSTFLOWS_H
+#define HUGO_MINCOSTFLOWS_H
 
 ///\ingroup galgs
 ///\file
-///\brief An algorithm for finding k paths of minimal total length.
+///\brief An algorithm for finding a flow of value \c k (for small values of \c k) having minimal total cost 
 
 #include <iostream>
 #include <dijkstra.h>
@@ -18,17 +18,24 @@
 /// \addtogroup galgs
 /// @{
 
-  ///\brief Implementation of an algorithm for finding k paths between 2 nodes 
-  /// of minimal total length 
+  ///\brief Implementation of an algorithm for finding a flow of value \c k 
+  ///(for small values of \c k) having minimal total cost between 2 nodes 
+  /// 
   ///
-  /// The class \ref hugo::MinLengthPaths "MinLengthPaths" implements
-  /// an algorithm for finding k edge-disjoint paths
+  /// The class \ref hugo::MinCostFlows "MinCostFlows" implements
+  /// an algorithm for finding a flow of value \c k 
+  ///(for small values of \c k) having minimal total cost  
   /// from a given source node to a given target node in an
-  /// edge-weighted directed graph having minimal total weigth (length).
+  /// edge-weighted directed graph having nonnegative integer capacities.
+  /// The range of the length (weight) function is nonnegative reals but 
+  /// the range of capacity function is the set of nonnegative integers. 
+  /// It is not a polinomial time algorithm for counting the minimum cost
+  /// maximal flow, since it counts the minimum cost flow for every value 0..M
+  /// where \c M is the value of the maximal flow.
   ///
   ///\author Attila Bernath
   template <typename Graph, typename LengthMap>
-  class MinLengthPaths {
+  class MinCostFlows {
 
     typedef typename LengthMap::ValueType Length;