Changeset 523:4da6fb104664 in lemon0.x for src/work
 Timestamp:
 05/04/04 14:00:13 (19 years ago)
 Branch:
 default
 Phase:
 public
 Convert:
 svn:c9d7d8f590d60310b91f818b3a526b0e/lemon/trunk@689
 File:

 1 copied
Legend:
 Unmodified
 Added
 Removed

src/work/athos/mincostflows.h
r520 r523 1 1 // * c++ * 2 #ifndef HUGO_MIN LENGTHPATHS_H3 #define HUGO_MIN LENGTHPATHS_H2 #ifndef HUGO_MINCOSTFLOWS_H 3 #define HUGO_MINCOSTFLOWS_H 4 4 5 5 ///\ingroup galgs 6 6 ///\file 7 ///\brief An algorithm for finding k paths of minimal total length.7 ///\brief An algorithm for finding a flow of value \c k (for small values of \c k) having minimal total cost 8 8 9 9 #include <iostream> … … 19 19 /// @{ 20 20 21 ///\brief Implementation of an algorithm for finding k paths between 2 nodes 22 /// of minimal total length 21 ///\brief Implementation of an algorithm for finding a flow of value \c k 22 ///(for small values of \c k) having minimal total cost between 2 nodes 23 /// 23 24 /// 24 /// The class \ref hugo::MinLengthPaths "MinLengthPaths" implements 25 /// an algorithm for finding k edgedisjoint paths 25 /// The class \ref hugo::MinCostFlows "MinCostFlows" implements 26 /// an algorithm for finding a flow of value \c k 27 ///(for small values of \c k) having minimal total cost 26 28 /// from a given source node to a given target node in an 27 /// edgeweighted directed graph having minimal total weigth (length). 29 /// edgeweighted directed graph having nonnegative integer capacities. 30 /// The range of the length (weight) function is nonnegative reals but 31 /// the range of capacity function is the set of nonnegative integers. 32 /// It is not a polinomial time algorithm for counting the minimum cost 33 /// maximal flow, since it counts the minimum cost flow for every value 0..M 34 /// where \c M is the value of the maximal flow. 28 35 /// 29 36 ///\author Attila Bernath 30 37 template <typename Graph, typename LengthMap> 31 class Min LengthPaths {38 class MinCostFlows { 32 39 33 40 typedef typename LengthMap::ValueType Length;
Note: See TracChangeset
for help on using the changeset viewer.