COIN-OR::LEMON - Graph Library

Changeset 523:4da6fb104664 in lemon-0.x


Ignore:
Timestamp:
05/04/04 14:00:13 (16 years ago)
Author:
athos
Branch:
default
Phase:
public
Convert:
svn:c9d7d8f5-90d6-0310-b91f-818b3a526b0e/lemon/trunk@689
Message:

Started.

File:
1 copied

Legend:

Unmodified
Added
Removed
  • src/work/athos/mincostflows.h

    r520 r523  
    11// -*- c++ -*-
    2 #ifndef HUGO_MINLENGTHPATHS_H
    3 #define HUGO_MINLENGTHPATHS_H
     2#ifndef HUGO_MINCOSTFLOWS_H
     3#define HUGO_MINCOSTFLOWS_H
    44
    55///\ingroup galgs
    66///\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
    88
    99#include <iostream>
     
    1919/// @{
    2020
    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  ///
    2324  ///
    24   /// The class \ref hugo::MinLengthPaths "MinLengthPaths" implements
    25   /// an algorithm for finding k edge-disjoint 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 
    2628  /// from a given source node to a given target node in an
    27   /// edge-weighted directed graph having minimal total weigth (length).
     29  /// edge-weighted 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.
    2835  ///
    2936  ///\author Attila Bernath
    3037  template <typename Graph, typename LengthMap>
    31   class MinLengthPaths {
     38  class MinCostFlows {
    3239
    3340    typedef typename LengthMap::ValueType Length;
Note: See TracChangeset for help on using the changeset viewer.